题目:
题意:
给你一段区间,需要你求出(在这段区间之类的最小值*这段区间所有元素之和)的最大值
题解:
单调栈的基本应用
注意因为数列可能全是0使答案为0,ans的初值应设为负数!
代码:
#include <cstdio>
#include <iostream>
#define N 100005
#define INF 1e9
#define LL long long
using namespace std;
int a[N],stack[N],l[N],r[N];
LL sum[N];
int main()
{
int n,i;
scanf("%d",&n);
for (i=1;i<=n;i++) scanf("%d",&a[i]),sum[i]=sum[i-1]+a[i],l[i]=1,r[i]=n;
int top=0;
for (i=1;i<=n;i++)
{
while (top && a[stack[top]]>a[i])
{
r[stack[top]]=i-1;
top--;
}
stack[++top]=i;
}
top=0;
for (i=n;i>=1;i--)
{
while (top && a[stack[top]]>a[i])
{
l[stack[top]]=i+1;
top--;
}
stack[++top]=i;
}
LL ans=-INF;int ansx,ansy;
for (i=1;i<=n;i++)
{
LL lj=(sum[r[i]]-sum[l[i]-1])*(LL)a[i];
if (ans<lj)
{
ans=lj;
ansx=l[i]; ansy=r[i];
}
}
printf("%lld\n%d %d",ans,ansx,ansy);
}