题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1985
题意:求最长矩形面积
方法:dp,求出每个点左右能达的最大距离
//利用r,l数组记录,以这个点为最低点时的左右可到达的范围,然后向左向右迭代搜就行了
#include<cstdio>
long long max(long long a,long long b)
{
return a>b?a:b;
}
int main()
{
int n;
while(scanf("%d",&n),n)
{
long long h[n+1],l[n+1],r[n+1];
int i,j;
for(i=1;i<=n;i++) scanf("%lld",h+i);
for(i=1;i<=n;i++)
{
l[i]=i; r[i]=i;
}
h[0]=-1; h[n+1]=-1;//设置边界
for(i=2;i<=n;i++)//求左边界
{
j=i;
while(h[i]<=h[l[j]-1]) j=l[j]-1;
l[i]=l[j];
}
for(i=n-1;i>=1;i--)//求右边界
{
j=i;
while(h[i]<=h[r[j]+1]) j=r[j]+1;
r[i]=r[j];
}
long long ans=-1;
for(int i=1;i<=n;i++)
ans=max(h[i]*(long long)(r[i]-l[i]+1),ans);
printf("%lld\n",ans);
}
return 0;
}