poj 2559 Largest Rectangle in a Histogram
2016-04-17 14:23
225 查看
Largest Rectangle in a Histogram
Description
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows the histogram that consists of rectangles with the heights
2, 1, 4, 5, 1, 3, 3, measured in units where 1 is the width of the rectangles:
Usually, histograms are used to represent discrete distributions, e.g., the frequencies of characters in texts. Note that the order of the rectangles, i.e., their heights, is important. Calculate the area of the largest rectangle in a histogram that is aligned
at the common base line, too. The figure on the right shows the largest aligned rectangle for the depicted histogram.
Input
The input contains several test cases. Each test case describes a histogram and starts with an integer n, denoting the number of rectangles it is composed of. You may assume that 1<=n<=100000. Then follow n integers h1,...,hn,
where 0<=hi<=1000000000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is 1. A zero follows the input for the last test case.
Output
For each test case output on a single line the area of the largest rectangle in the specified histogram. Remember that this rectangle must be aligned at the common base line.
Sample Input
Sample Output
Hint
Huge input, scanf is recommended.
Source
Ulm Local 2003
题解:单调栈
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 18332 | Accepted: 5891 |
A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows the histogram that consists of rectangles with the heights
2, 1, 4, 5, 1, 3, 3, measured in units where 1 is the width of the rectangles:
Usually, histograms are used to represent discrete distributions, e.g., the frequencies of characters in texts. Note that the order of the rectangles, i.e., their heights, is important. Calculate the area of the largest rectangle in a histogram that is aligned
at the common base line, too. The figure on the right shows the largest aligned rectangle for the depicted histogram.
Input
The input contains several test cases. Each test case describes a histogram and starts with an integer n, denoting the number of rectangles it is composed of. You may assume that 1<=n<=100000. Then follow n integers h1,...,hn,
where 0<=hi<=1000000000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is 1. A zero follows the input for the last test case.
Output
For each test case output on a single line the area of the largest rectangle in the specified histogram. Remember that this rectangle must be aligned at the common base line.
Sample Input
7 2 1 4 5 1 3 3 4 1000 1000 1000 1000 0
Sample Output
8 4000
Hint
Huge input, scanf is recommended.
Source
Ulm Local 2003
题解:单调栈
#include<iostream> #include<cstdio> #include<algorithm> #define ll long long using namespace std; ll m,n,a[200003],top,st[200003]; struct data { ll l,r; };data f[200003]; void insert(ll x) { while(a[x]<=a[st[top]]&&top) { f[x].l=f[st[top]].l; f[st[top-1]].r=f[st[top]].r; top--; } f[st[top]].r=f[x].r; st[++top]=x; } int main() { while (scanf("%lld",&n)) { if (n==0) break; for (ll i=1;i<=n;i++) { scanf("%lld",&a[i]); f[i].l=f[i].r=i; } for (ll i=1;i<=n;i++) insert(i); while(top) f[st[top-1]].r=f[st[top]].r,top--; ll ans=0; for (ll i=1;i<=n;i++) ans=max(ans,(f[i].r-f[i].l+1)*a[i]); printf("%lld\n",ans); } return 0; }
相关文章推荐
- WebService学习总结(1)——WebService相关概念
- 集成tiles3时遇到的问题,mark一下
- Hadoop学习笔记(4)-Eclipse下搭建Hadoop2.6.4开发环境
- Oracle-SQL01
- mysql explain执行计划详解
- Jquery学习之旅之chaining
- bzoj 2937: [Poi2000]建造酿酒厂
- procfs、debugfs
- 《机电传动控制》学习笔记08-1
- [LeetCode]Verify Preorder Serialization of a Binary Tree
- Android_AndroidManifest.xml
- 《机电传动控制》学习笔记-07
- jquery根据name属性查找
- HDU 1050(其实应该是线段树但规模太小,没必要)
- [Data Structure] Maximum Subsequence Sum
- 技术文章写作及运营的技巧:分析篇 | 什么样的文章受欢迎?
- php序列化存储数据
- 【杭电oj】-2099-整除的尾数(求未知的后两位)
- 20145337《JAVA程序设计》第七周学习总结
- iOS地图开发-高德地图