还是太愚笨了。+++
#include"iostream"
#include"cstdio"
#include"algorithm"
#include"vector"
#include"string"
#include"stack"
using namespace std;
const int maxn=100000+10;
typedef long long LL;
int n;
LL a[maxn],L[maxn],R[maxn];
int main()
{
//freopen("a.txt","r",stdin);
while(scanf("%d",&n),n)
{
for(int i=1;i<=n;i++)
scanf("%lld",&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 Max=0;
for(int i=1;i<=n;i++)
{
Max=max(Max,(R[i]-L[i]+1)*a[i]);
}
cout<<Max<<endl;
}
return 0;
}