uva 1506 Largest Rectangle in a Histogram
2017-08-07 17:41
274 查看
Largest Rectangle in a Histogram
http://acm.hdu.edu.cn/showproblem.php?pid=1506Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
[align=left]Problem Description[/align]
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:
![](http://acm.hdu.edu.cn/data/images/1506-1.gif)
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0
[align=left]Sample Output[/align]
8
4000
[align=left]Source[/align]
University
of Ulm Local Contest 2003
[align=left]Recommend[/align]
LL |
We have carefully selected several similar
problems for you: 1505 1069 1087 1058 1176
题意:有n个数ai。从中选出一段区间[L,R],使得(R-L+1)*min{a_L,…,a_R}最大。
经典广告印刷问题
考虑对于第i个数,求出当这个数成为最小值时,往左往右分别最远能到哪里。
使用单调队列来实现这一过程。
#include<cstdio> #include<algorithm> #define N 100001 #ifdef WIN32 #define ll "%I64d\n" #else #define ll "%lld\n" #endif using namespace std; int n,a ,b ; int q ,tmp ,head,tail; int l ,r ; long long ans; void monotonous(int *c,int *d) { q[0]=c[1]; tmp[0]=1; head=0; tail=1; for(int i=2;i<=n;i++) { if(c[i]<q[tail-1]) while(head<tail && q[tail-1]>c[i]) d[tmp[--tail]]=i-1; q[tail]=c[i]; tmp[tail++]=i; } while(head<tail) d[tmp[head++]]=n; } int main() { while(scanf("%d",&n)!=EOF) { if(!n) return 0; ans=0; for(int i=1;i<=n;i++) scanf("%d",&a[i]),b[n-i+1]=a[i]; monotonous(a,r); monotonous(b,l); for(int i=1;i<=n;i++) tmp[i]=l[i]; for(int i=1;i<=n;i++) l[n-i+1]=n-tmp[i]+1; for(int i=1;i<=n;i++) ans=max(ans,1ll*(r[i]-l[i]+1)*a[i]); printf(ll,ans); } }
相关文章推荐
- hdu1506 Largest Rectangle in a Histogram
- HDU 1506 Largest Rectangle in a Histogram
- HDU 1506 Largest Rectangle in a Histogram
- hdu 1506 Largest Rectangle in a Histogram
- HDU_1506_Largest Rectangle in a Histogram_dp
- hdu 1506 Largest Rectangle in a Histogram
- 暑期dp46道(8)--HDOJ 1506 Largest Rectangle in a Histogram
- hdu 1506 Largest Rectangle in a Histogram
- HDU 1506 Largest Rectangle in a Histogram (最大子矩形面积)
- 【DP+预处理|最长连续子序列】HDU-1506 Largest Rectangle in a Histogram
- HDU-1506 (POJ-2599) Largest Rectangle in a Histogram (单调栈)
- HDU 1506 Largest Rectangle in a Histogram【矩阵最大面积】
- HDU1506 Largest Rectangle in a Histogram
- hdu 1506 Largest Rectangle in a Histogram
- hdu 1506(nyoj 258)Largest Rectangle in a Histogram(最大长方形(二))(单调栈)
- hdu 1506/poj 2559 Largest Rectangle in a Histogram
- F - Largest Rectangle in a Histogram(HDU-1506)
- HDU 1506 Largest Rectangle in a Histogram
- Largest Rectangle in a Histogram (poj 2559 && hdu 1506 矩形系列 迭代法)
- [dp]POJ2559 && HDOJ1506 Largest Rectangle in a Histogram