Largest Rectangle in a Histogram
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7038 Accepted Submission(s): 1982
Problem 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
7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0
Sample Output
1/**//*用dp方法解決，首先是對于每個h[i],都有s[i]=h[i]*(r-j+1),r為從i右邊第一個起，若好h[r]>=h[i],則r++;左邊同理
2
最后求出max（s[i]）即可*/
3
#include<cstdio>
4#include<iostream>
5using namespace std;
6#define INF 100010
7int l[INF],r[INF],n,i;
8int main()
9
{
10
_int64 h[INF],s,max; // 結果可能超出int，h初始為__int64 或運算前強轉化為__int64。運算過程中int會溢出
11 while(cin>>n&&n)
12
{
13 s=0;
14 for(i=1;i<=n;i++)
15 {
16 scanf("%I64d",&h[i]);
17 l[i]=r[i]=i;
18
19
}
20 h[0]=h[n+1]=-1;//題目中h[i]可能為0，初始化height數組為-1，防止死循環。
21 for(i=1;i<=n;i++)
22 {
23 while(h[l[i]-1]>=h[i])//左移
24 l[i]=l[l[i]-1];
25
26 }
27 for(i=n;i>=1;i--)
28 {
29 while(h[r[i]+1]>=h[i]) //右移
30
31 r[i]=r[r[i]+1];
32 }
33 max=0;
34 for(i=1;i<=n;i++)
35 {
36 s=h[i]*(r[i]-l[i]+1);
37 max=s>max? s:max;
38
39 }
40 printf("%I64d\n",max);
41
42 }
43 return 0;
44}PS：有無有更加快速的方法呢，時間上還是比較慢
posted on 2013-05-01 23:19
天YU地___PS，代碼人生 閱讀(187)
評論(0) 編輯 收藏 所屬分類:
acm