hdoj 1506 Largest Rectangle in a Histogram

DP 找出 a[i] 的左边和右边与自己连着的比自己大的数的长度 , 然后用这个长度乘以 a[i], 乘积最大的那个就是答案 .

#include<stdio.h>
#include<string.h>
#define LL long long
#define N 100005

int i,n,t;
LL a[N],l[N],r[N],max;
int main()
{
    while (scanf("%d",&n) &&  n)
    {
        for (i=1; i<=n; ++i) scanf("%I64d",&a[i]);
        l[1]=1;
        r[n]=n;
        for (i=2; i<=n; ++i)
        {
            t=i;
            while (t>1 && a[i]<=a[t-1]) t=l[t-1];
            l[i]=t;
        }
        for (i=n-1; i>=1; --i)
        {
            t=i;
            while (t<n && a[i]<=a[t+1]) t=r[t+1];
            r[i]=t;
        }
        max=0;
        for (i=1; i<=n; ++i)
        {
            if ((r[i]-l[i]+1)*a[i]>max) max=(r[i]-l[i]+1)*a[i];
        }
        printf("%I64d\n",max);
    }
    return 0;
}