题目:https://nanti.jisuanke.com/t/38228
题解:求出每一个数的左右端点(比它大的数),对于正数,直接用该数乘以区间和,对于负数,先求出该区间的最小区间和,再计算,负数的情况可以以该数为中心,先计算左边最小值,再加上右边最小值,即得出包含该数的最小区间和。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<cstring>
#include<set>
#include<vector>
#include<cmath>
#define LL long long
#define INF 0x3f3f3f3f3f3f3f3f
using namespace std;
const int maxn=5e5+5;
const int mod=1e9+7;
LL n,a[maxn];
LL L[maxn],R[maxn],minL[maxn],minR[maxn];
LL pre[maxn];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
pre[i]=pre[i-1]+a[i];
}
stack<int>st;
for(int i=1;i<=n;i++)
{
while(!st.empty()&&a[st.top()]>=a[i])
st.pop();
if(st.empty())
L[i]=1;
else
L[i]=st.top()+1;
st.push(i);
}
while(!st.empty())
st.pop();
for(int i=n;i>=1;i--)
{
while(!st.empty()&&a[st.top()]>=a[i])
st.pop();
if(st.empty())
R[i]=n;
else
R[i]=st.top()-1;
st.push(i);
}
for(int i=1;i<=n;i++)
{
if(a[i]>=0)
continue;
for(int j=L[i]-1;j<=i-1;j++)
minL[i]=min(minL[i],pre[i]-pre[j]);
for(int j=i+1;j<=R[i];j++)
minR[i]=min(minR[i],pre[j]-pre[i]);
}
LL ans=-INF;
for(int i=1;i<=n;i++)
{
if(a[i]>=0)
ans=max(ans,(pre[R[i]]-pre[L[i]-1])*a[i]);
else
ans=max(ans,(minL[i]+minR[i])*a[i]);
}
cout << ans << endl;
return 0;
}