POJ 2559 Largest Rectangle in a Histogram【单调栈】
来源:互联网 发布:小说网站php项目 编辑:程序博客网 时间:2024/06/06 07:09
Largest Rectangle in a Histogram
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22070 Accepted: 7133
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.
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 34 1000 1000 1000 10000
Sample Output
84000
Hint
Huge input, scanf is recommended.
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cmath>#include<queue>#include<stack>#include<vector>#include<map>#include<set>#include<algorithm>using namespace std;#define ll long long#define ms(a,b) memset(a,b,sizeof(a))const int M=1e5+10;const int inf=0x3f3f3f3f;const int mod=1e9+7;int i,j,k,n,m;int h[M];int L[M],R[M];int st[M];void solve(){ int t=0; for(int i=0;i<n;i++){ while(t>0&&h[st[t-1]]>=h[i])t--; L[i]=t==0?0:(st[t-1]+1); st[t++]=i; } t=0; for(int i=n-1;i>=0;i--){ while(t>0&&h[st[t-1]]>=h[i])t--; R[i]=t==0?n:st[t-1]; st[t++]=i; } ll res=0; for(int i=0;i<n;i++){ res=max(res,(ll)h[i]*(R[i]-L[i])); } printf("%lld\n",res);}int main(){ while(~scanf("%d",&n),n){ for(int i=0;i<n;i++){ scanf("%d",&h[i]); } solve(); } return 0;}
阅读全文
0 0
- POJ 2559 -- Largest Rectangle in a Histogram ( 单调栈 )
- 【单调栈】POJ-2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram(单调栈)
- POJ 2559 Largest Rectangle in a Histogram RMQ || 单调栈
- POJ 2559 Largest Rectangle in a Histogram(单调栈)
- POJ - 2559 Largest Rectangle in a Histogram 单调栈
- 【单调栈】POJ 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram(单调栈)
- POJ-2559-Largest Rectangle in a Histogram-单调栈
- 【POJ 2559】Largest Rectangle in a Histogram(单调栈)
- poj 2559 Largest Rectangle in a Histogram(单调栈)
- poj--2559 Largest Rectangle in a Histogram(单调栈)
- 单调栈1002 POJ 2559 Largest Rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram 单调栈
- [POJ 2559 Largest Rectangle in a Histogram] 单调栈
- POJ 2559 Largest Rectangle in a Histogram (单调栈)
- [poj 2559] Largest Rectangle in a Histogram:单调栈
- POJ 2559 - Largest Rectangle in a Histogram(单调栈)
- python0710
- 曾国藩:人才都是熬出来的,本事都是逼出来的
- CBW、CWDE、CDQ、CWD: 扩展指令
- 数据库连接池
- htmlunit爬取Ajax动态生成的网页获取不到生成后的结果的问题的解决
- POJ 2559 Largest Rectangle in a Histogram【单调栈】
- 为什么SPSS的日期要以1582年10月14日为基准
- 测试代码
- 解决Android应用方法数不能超过65K问题-使用multidex来解决方法数越界
- MongoDB操作数据库
- SQL 去重不用distinct如何实现?
- android手势
- 手势与ViewFlipper
- 自定义左右或上下滑动翻页