CCF认证201312-3最大的矩形
#include<bits/stdc++.h>
using namespace std;
const int N=1000;
int a[N+5];
int area[N+5];
int main()
{
memset(area,0,sizeof(area));
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
area[i]+=a[i];
int j=i+1,k=i-1;
while(a[j]>=a[i]&&j<=n)
{
area[i]+=a[i];
j++;
}
while(a[k]>=a[i]&&k>=1)
{
area[i]+=a[i];
k--;
}
}
sort(area+1,area+n+1);
cout<<area[n]<<endl;
return 0;
}
/*
6
3 1 6 5 2 3
*/