Largest Rectangle in a Histogram POJ - 2559 单调栈
2017-10-14 11:22
369 查看
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.
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
#include<queue>
using namespace std;
const int M=100010;
int n;
int h[M],l[M],r[M],st[M];
int main()
{
while(scanf("%d",&n),n)
{
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
memset(st,0,sizeof(st));
for(int i=0;i<n;i++)
scanf("%d",&h[i]);
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;
}
long long ans=0;
for(int i=0;i<n;i++)
{
ans=max(ans,(long long)h[i]*(r[i]-l[i]));
}
printf("%lld\n",ans);
}
return 0;
}
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.
#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
#include<queue>
using namespace std;
const int M=100010;
int n;
int h[M],l[M],r[M],st[M];
int main()
{
while(scanf("%d",&n),n)
{
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
memset(st,0,sizeof(st));
for(int i=0;i<n;i++)
scanf("%d",&h[i]);
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;
}
long long ans=0;
for(int i=0;i<n;i++)
{
ans=max(ans,(long long)h[i]*(r[i]-l[i]));
}
printf("%lld\n",ans);
}
return 0;
}
相关文章推荐
- [poj 2559] Largest Rectangle in a Histogram:单调栈
- 单调栈--poj2559 Largest rectangle in a Histogram
- POJ 2559 Largest Rectangle in a Histogram --维护单调栈
- NYOJ-258/POJ-2559/HDU-1506 Largest Rectangle in a Histogram,最大长方形,dp或者单调队列!
- 每日一dp(1)——Largest Rectangle in a Histogram(poj 2559)使用单调队列优化
- 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 单调栈
- HDU 1506 && POJ 2559 Largest Rectangle in a Histogram (单调队列)
- POJ 2559 Largest Rectangle in a Histogram RMQ || 单调栈
- 单调队列 POJ 2559 Largest Rectangle in a Histogram
- POJ2559 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(DP二维超内存,用一维或者用结构体)
- POJ2559 - Largest Rectangle in a Histogram - 单调栈+DP
- POJ - 2559 Largest Rectangle in a Histogram (单调栈与区间问题)
- POJ 2559 Largest Rectangle in a Histogram(单调栈)@
- POJ 2559 Largest Rectangle in a Histogram