HDU-1506 Largest Rectangle in a Histogram

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

题意：条形图的宽度全部为$1$给出条形图的高度问条形图围成的最大面积是多少？
思路：首先要明白：条形图要想与其他条形图围成矩形那么他们的高度必须满足大于等于此条形图的高度；由此，我们可以枚举每一个条形图，把他当作最矮的，然后进行左右查询；
具体操作看代码吧：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define ll long long
const int N=1e5+1000;
ll a[N],l[N],r[N];
int main()
{
    int n;
    while(cin>>n&&n)
    {
        for(int i=1; i<=n; i++)
            cin>>a[i];
        l[1]=1;
        r[n]=n;
        for(int i=2; i<=n; i++)//求出每个矩形左端非递减连续的下标
        {
            int t=i;
            while(t>1&&a[i]<=a[t-1])
                t=l[t-1];
            l[i]=t;
        }
        for(int i=n-1; i>=1; i--)//求出每个矩形右端非递减连续的下标
        {
            int t=i;
            while(t<n&&a[i]<=a[t+1])
                t=r[t+1];
            r[i]=t;
        }
        ll ans=0;
        for(int i=1; i<=n; i++)
            ans=max(ans,(r[i]-l[i]+1)*a[i]);
        cout<<ans<<endl;
    }
    return 0;
}

实践才是检验真理的唯一标准；