Largest Rectangle in a Histogram (最大子矩阵)

hdu 1506

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.

InputThe 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.OutputFor 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

// 第一个数 n ,代表后面有几个数，后面 n 个数代表长方体的高，宽都是 1 ，并且n个长方体紧靠，问最大的矩形面积

L[i] 代表 h[j]>=h[i](j<=i) 的最远的编号

R[i] 代表 h[j]>=h[i](j>=i) 的最远的编号

求出来后，就可以去找最大矩形了，遍历一遍 maxS = max( (R[i]-L[i]+1)*h[i] ) (1<=i<=n)

 #include <iostream>
 #include <stdio.h>
 #include <string.h>
 using namespace std;
 #define MAXN 100005
 #define LL long long
 LL L[MAXN];
 LL R[MAXN];
 LL h[MAXN];

 int main()
 {
     int n;
     while (scanf("%d",&n)&&n)
     {
         for (int i=;i<=n;i++)
             scanf("%I64d",&h[i]);
         h[]=h[n+]=-;
         for (int i=;i<=n;i++)
         {
             L[i]=i;
             while (h[L[i]-]>=h[i]) //利用 L[] 去循环,其实很快
                 L[i]=L[L[i]-];
         }
         for (int i=n;i>=;i--)
         {
             R[i]=i;
             while (h[R[i]+]>=h[i])
                 R[i]=R[R[i]+];
         }
         LL ans = ;
         for (int i=;i<=n;i++)
         {
             LL area = (R[i]-L[i]+)*h[i];
             if(area>ans) ans = area;
         }
         printf("%I64d\n",ans);
     }
     return ;
 }