码迷,mamicode.com
首页 > 其他好文 > 详细

hdu 1506 Largest Rectangle in a Histogram DP

时间:2015-01-19 10:57:24      阅读:167      评论:0      收藏:0      [点我收藏+]

标签:hduj   c++   

Largest Rectangle in a Histogram

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12222    Accepted Submission(s): 3392


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
8 4000


#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
#define M 100005
typedef long long in;
in l[M],r[M],h[M];

int main(){
    in n;
    while(cin>>n && n){
        in i,j;
        for(i=0;i<=n;i++){
            l[i]=i;
            r[i]=i;
        }
        for(i=1;i<=n;i++){
            cin>>h[i];
            j=i-1;
            while(l[i]!=1 && h[i]<=h[j]){
                l[i]=l[j];
                j=l[j]-1;
            }
        }
        for(i=n;i>=1;i--){
            j=i+1;
            while(r[i]!=n && h[i]<=h[j]){
                r[i]=r[j];
                j=r[j]+1;
            }
        }
        in ans=0;
        for(i=1;i<=n;i++){
            ans=max(ans,(r[i]-l[i]+1)*h[i]);
        }
        cout<<ans<<endl;
    }
    return 0;
}


hdu 1506 Largest Rectangle in a Histogram DP

标签:hduj   c++   

原文地址:http://blog.csdn.net/hyccfy/article/details/42869613

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!