luogu P2422 良好的感觉 单调栈

Code:

#include<bits/stdc++.h>
#define maxn 1000000 
#define ll long long 
using namespace std;
void setIO(string s)
{
	string in=s+".in"; 
	freopen(in.c_str(),"r",stdin);    
}
int S[maxn],top,n; 
ll f[maxn],sumv[maxn],arr[maxn];  
int main()
{
	// setIO("input"); 
	S[++top]=0;     
	scanf("%d",&n); 
	for(int i=1;i<=n;++i)
	{
		scanf("%lld",&arr[i]); 
		sumv[i]=sumv[i-1]+arr[i]; 
		while(arr[S[top]] > arr[i]) 
		{
			f[S[top]] += sumv[i-1]-sumv[S[top]];          
			--top; 
		}
		f[i]=sumv[i]-sumv[S[top]];     
		S[++top]=i;       
	}
	ll ans=0; 
	for(int i=1;i<=n;++i) ans=max(ans,f[i]*arr[i]); 
	printf("%lld\n",ans); 
    return 0; 
}