Largest Rectangle in a Histogram（DP）

Largest Rectangle in a Histogram

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 16   Accepted Submission(s) : 6

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

 

 

一道用DP来做的题目：

对于条形图的每一条列，如果比前面的小，那么把他们放在一起肯定比单独算面积要大，右边如此！！

 

对于直方图的每一个右边界，穷举所有的左边界。将面积最大的那个值记录下来。时间复杂度为O(n^2). 单纯的穷举在LeetCode上面过大集合时会超时。可以通过选择合适的右边界，做一个剪枝(Pruning)。观察发现当height[k] >= height[k - 1]时，无论左边界是什么值，选择height[k]总会比选择height[k - 1]所形成的面积大。因此，在选择右边界的时候，首先找到一个height[k] < height[k - 1]的k，然后取k - 1作为右边界，穷举所有左边界，找最大面积。

 

 #include<iostream>
 #include<algorithm>
 #include<string.h>
 #include<stdio.h>
 using namespace std;
  int b[],c[];
 __int64 a[];
 int main()
 {
    int n,m,i;
    __int64 max;
 while(scanf("%I64d",&n)!=EOF&&n)
 {
     for(i=;i<=n;i++)
     scanf("%d",&a[i]);
     for(i=;i<=n;i++)
     {
         b[i]=i;
         c[i]=i;
     }
     for(i=;i<=n;i++)
     {
         m=i;
         while(a[m-]>=a[i])
         {
             b[i]=b[m-];
             m=b[m-];
             if(m==)
             break;
         }
     }
     for(i=n-;i>=;i--)
     {
         m=i;
         while(a[m+]>=a[i])
         {
             c[i]=c[m+];
             m=c[m+];
             if(m==n)
             break;
         }
     }
     max=a[]*(c[]-b[]+);
     for(i=;i<=n;i++)
     {
         if(a[i]*(c[i]-b[i]+)>=max)
         max=a[i]*(c[i]-b[i]+);
     }
     printf("%I64d\n",max);
 }
 return ;
 }