思路:利用并查集的性质,然后找出最左边和最右边满足高度差的值,乘以高度 求解最大值 即可
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string.h>
#include<vector>
using namespace std;
const int maxn=100010;
long long height[maxn];
long long dis[maxn];
long long ans;
long long max(long long a,long long b)
{
return a>b?a:b;
}
void get_sum(int n)
{
vector<long long>L(2*n,0);
vector<long long>R(2*n,0);
height[0]=height[n+1]=-1;
for(int i=0; i<=n; i++)
{
L[i]=i;
R[i]=i;
}
for(int i=1; i<=n; i++)
while(height[i]<=height[L[i]-1])
L[i]=L[L[i]-1];
for(int i=n;i>=1;i--)
while(height[i]<=height[R[i]+1])
R[i]=R[R[i]+1];
for(int i=1;i<=n;i++)
ans=max(ans,(dis[R[i]]-dis[L[i]]+1)*height[i]);
}
int main()
{
int m,n;
while(scanf("%d",&n)!=EOF)
{
if(!n)
break;
ans=0;
memset(dis,0,sizeof(dis));
memset(height,0,sizeof(height));
for(int i=1; i<=n; i++)
dis[i]=1+dis[i-1];
for(int i=1; i<=n; i++)
scanf("%lld",&height[i]);
get_sum(n);
printf("%lld\n",ans);
}
return 0;
}