题目链接
AC代码
#include<iostream>
using namespace std;
typedef long long ll;
const int N = 1e5+9;
ll h[N];
int n;
int stk[N],l[N],r[N];
int tt = 0;
int main(){
while(~scanf("%d",&n)&&n)
{
for(int i=1; i<=n; i++) scanf("%lld",&h[i]);
tt = 0;
for(int i=1; i<=n; i++)
{
while(tt&&h[stk[tt]]>=h[i]) tt--;
if(tt) l[i] = stk[tt];
else l[i] = 0;
stk[++tt] = i;
}
tt = 0;
for(int i=n; i>=1; i--)
{
while(tt&&h[stk[tt]]>=h[i]) tt--;
if(tt) r[i] = stk[tt];
else r[i] = n+1;
stk[++tt] = i;
}
ll ans = -1;
for(int i=1; i<=n; i++)
{
ans = max(ans,(r[i]-l[i]-1)*h[i]);
}
printf("%lld\n",ans);
}
return 0;
}