单调对列 good feeling

#include<bits/stdc++.h>//复杂度O(n^2)数据水
using namespace std;
typedef long long LL;
#define max(a,b) ((a)>(b)?(a):(b))
/long long max(long long x,long long y)
{
return x>y?x:y;
}/
const LL N=1e5+5;
LL data[N],ans;//data求前缀和
deque vis1,vis2;//记录下标
LL a[N];
int main()
{
LL n;
scanf("%lld",&n);
for(LL i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
data[i]=data[i-1]+a[i];
}
for(LL i=1;i<=n;i++)
{
for(LL j=i;j>=1;j–)//往左推
{
while(!vis1.empty()&&a[j]>=a[i])
vis1.pop_back();
vis1.push_back(j);
if(a[i]>a[j]) break;//有小的就退出
}
//得到vis1.front(),最左侧的下标
for(LL j=i;j<=n;j++)//往右推
{
while(!vis2.empty()&&a[j]>=a[i])
vis2.pop_back();
vis2.push_back(j);
if(a[i]>a[j]) break;
}
//得到vis2.front(),最右侧的下标
ans=max(ans,(a[i]*(data[vis2.front()]-data[vis1.front()-1])));
while(!vis1.empty()) vis1.pop_back();
while(!vis2.empty()) vis2.pop_back();
}
printf("%lld\n",ans);
return 0;
}
5
3 1 6 4 5 2
output
60

max=(6+4+5)*4
https://www.luogu.org/problemnew/show/P2422