hdu 1506 Largest Rectangle in a Histogram

Largest Rectangle in a Histogram

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 12999    Accepted Submission(s): 3672

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
  
  

 

Source

University of Ulm Local Contest 2003 

题目大意：首先给你一个数n，然后有n个数，每个数代表直方图的高，让你求直方图形成的最大的矩形的面积。
对于每一块木板，Area=height[i]*(j-k+1) 其中，j<=x<=k,height[x]>=height[i]；找j,k成为关键，一般方法肯定超时，利用动态规划，如果它左边高度大于等于它本身，那么它左边的左边界一定满足这个性质，再从这个边界的左边迭代下去，同理，如果它右边高度大于等于它本身，那么那么它右边的右边界一定满足这个性质，再从这个边界的右边迭代下去。

#include <iostream>
using namespace std;
int r[100005],l[100005];
long long high[100005];

int main()
{
    int i, n;
    while(cin>>n)
    {
        if(n == 0)
            break;
        long long maxn, area;
        for(i=1; i<=n; i++)
        {
            cin>>high[i];
            r[i] = l[i] = i;
        }
        high[0] = high[n+1] = -1;
        for(i=n; i>=1; i--)  //找右边界，从最右边开始
        {
            while(high[i] <= high[r[i]+1])
                r[i] = r[r[i]+1];
        }
        for(i=1; i<=n; i++)//找左边界，从最左边开始
        {
            while(high[i] <= high[l[i]-1])
                l[i] = l[l[i]-1];
        }
        maxn = 0;
        for(i=1; i<=n; i++)
        {
            area = (r[i]-l[i]+1)*high[i];
            maxn = max(area,maxn);
        }
        cout<<maxn<<endl;
    }
    return 0;
}

该题的加强版：1505 http://write.blog.csdn.net/postedit/44982535