一句话翻译题意:
给定含有
n
n
个含有非负整数的数列 。最大化
(∑ai)∗min(ai)
(
∑
a
i
)
∗
m
i
n
(
a
i
)
(l<=i<=r)
(
l
<=
i
<=
r
)
输出
l,r,sum
l
,
r
,
s
u
m
。
考虑每个点的贡献,如果他为乘的那个最小值的话,我们只要快速求出区间就好了,单调栈直接算就好了。
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll>par;
const ll MAXN=2e5+5;
const ll INF=1e18+7;
ll a[MAXN],n,top=0,l[MAXN],r[MAXN];
ll sum[MAXN];
par sta[MAXN];
ll calc(int x){
return 1ll*a[x]*(1ll*sum[r[x]]-sum[l[x]-1]);
}
void work(){
memset(sum,0,sizeof(sum));
memset(a,0,sizeof(a));
memset(sta,0,sizeof(sta));
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
top=0;
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
sum[i]=sum[i-1]+a[i];
}
sta[++top]=mp(-INF,0);
for(int i=1;i<=n;i++){
while(top&&sta[top].first>=a[i])top--;
l[i]=sta[top].second+1;
sta[++top]=mp(a[i],i);
}
top=0;
sta[++top]=mp(-INF,n+1);
for(int i=n;i>=1;i--){
while(top&&sta[top].first>=a[i])top--;
r[i]=sta[top].second-1;
sta[++top]=mp(a[i],i);
}
ll ans=-INF,ansl,ansr;
for(int i=1;i<=n;i++){
ll p=calc(i);
if(p>ans){
ans=p,ansl=l[i],ansr=r[i];
}
}
printf("%lld\n%lld %lld\n",ans,ansl,ansr);
}
int main(){
while(scanf("%lld",&n)!=EOF)work();
return 0;
}