南昌网络赛Max Answer

Alice has a magic array. She suggests that the value of a interval is equal to the sum of the values in the interval, multiplied by the smallest value in the interval.
Now she is planning to find the max value of the intervals in her array. Can you help her?

Input
First line contains an integer n(1 \le n \le 5 \times 10 ^5n(1≤n≤5×10 ^5).
Second line contains nn integers represent the array a(−10^5 ≤a i≤10^5 ).
Output
One line contains an integer represent the answer of the array.
样例输入 复制
5
1 2 3 4 5
样例输出 复制
36

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
using namespace std;
const int N=5*1e5+10;
long long dpmin[N][21],dpsumx[N][21],dpsumd[N][21],a[N],sum[N];int n;
void ST1()
{
	for(int i=1;i<=n;i++)dpmin[i][0]=a[i];
		for(int j=1;(1<<j)<=n;j++)
		for(int i=1;i+(1<<j)-1<=n;i++)
		{
			dpmin[i][j]=min(dpmin[i][j-1],dpmin[i+(1<<(j-1))][j-1]);
		}
}
void ST2()
{
	for(int i=1;i<=n;i++)dpsumx[i][0]=a[i]+dpsumx[i-1][0];
		for(int j=1;(1<<j)<=n;j++)
		for(int i=1;i+(1<<j)-1<=n;i++)
		{
			dpsumx[i][j]=min(dpsumx[i][j-1],dpsumx[i+(1<<(j-1))][j-1]);
		}
}
void ST3()
{
	
	for(int i=1;i<=n;i++){
		dpsumd[i][0]=a[i]+dpsumd[i-1][0];
	}
		for(int j=1;(1<<j)<=n;j++)
		for(int i=1;i+(1<<j)-1<=n;i++)
		{
			dpsumd[i][j]=max(dpsumd[i][j-1],dpsumd[i+(1<<(j-1))][j-1]);
		}
}
long long fmin(int left,int right)
{
	int s=log2(right-left+1);
	long long m=min(dpmin[left][s],dpmin[right-(1<<s)+1][s]);
	return m;
}
long long fmind(int left,int right)
{
	int s=log2(right-left+1);
	long long m=max(dpsumd[left][s],dpsumd[right-(1<<s)+1][s]);
	return m;
}
long long fminx(int left,int right)
{
	int s=log2(right-left+1);
	long long m=min(dpsumx[left][s],dpsumx[right-(1<<s)+1][s]);
	return m;
}
long long slove(int x)
{
	int left=x,right=n,pr=x,pl=x;
	while(left<=right)
	{
     	int mid=(left+right)/2;
		if(a[x]<=fmin(left,mid)){
			left=mid+1;
			pr=mid;
		}
		else {
			right=mid-1;
		}
	}
	left=1,right=x;
	while(left<=right)
	{
     	int mid=(left+right)/2;
	    if(a[x]<=fmin(mid,right)){
	    	right=mid-1;
	    	pl=mid;
		}
	    else {
	    	left=mid+1;
		}
	}
	long long ss=dpsumd[pr][0]-dpsumd[pl-1][0];
	return ss*a[x];
}
long long slove2(int x)
{
	int left=x,right=n,pr=x,pl=x;
	while(left<=right)
	{
     	int mid=(left+right)/2;
		if(a[x]<=fmin(left,mid)){
			left=mid+1;
			pr=mid;
		}
		else {
			right=mid-1;
		}
	}
	left=1,right=x;
	while(left<=right)
	{
     	int mid=(left+right)/2;
	    if(a[x]<=fmin(mid,right)){
	    	right=mid-1;
	    	pl=mid;
		}
	    else {
	    	left=mid+1;
		}
	}
	long long ss=fminx(x,pr)-fmind(pl,x);
	return ss*a[x];
}
int main()
{
	long long maxn=0;
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	ST1();
	ST2();
	ST3();
	int x,y;
//	while(scanf("%d%d",&x,&y))printf("%d\n",fmin(x,y));
	for(int i=1;i<=n;i++)
	{
		if(a[i]>0)maxn=max(slove(i),maxn);
		else maxn=max(slove2(i),maxn);
	}
	printf("%lld\n",maxn);
}

用rmq查询区间最小值，对于正数只需找到满足他是区间中最小值的最大区间（二分分别求左右端点），对于负数则要找到区间和的最小值，二分前缀和求解