@[juruo999](/user/371818)
我的 $O(n^2)$ 做法也能过,数据不强。
```cpp
#include<bits/stdc++.h>
using namespace std;
long long n;
long long a[100010];
long long maxx;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
for(int i=1;i<=n;i++)
{
long long sum=a[i],minn=a[i];
for(int j=i-1;j>=1;j--)
{
if(a[j]<a[i])break;
sum+=a[j];
}
for(int j=i+1;j<=n;j++)
{
if(a[j]<a[i])break;
sum+=a[j];
}
maxx=max(maxx,minn*sum);
}
cout<<maxx;
}
```
by LRY314 @ 2021-07-19 10:22:52
@[LRY314](/user/181654) 什么鬼?!!![我](https://cdn.luogu.com.cn/upload/image_hosting/gjnagm39.png)
by juruo999 @ 2021-07-19 12:29:24