Submission #1690845

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;

const int maxn=2e5+10;
int n,a[maxn],stk[maxn],top,l[maxn],r[maxn];
long long ans;

int main(){
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	for(int i=1;i<=n;++i){
		while(top&&a[stk[top-1]]>a[i])
			r[stk[--top]]=i-1;
		if(!top)
			l[i]=1;
		else
			l[i]=stk[top-1]+1;
		stk[top++]=i;
	}
	for(int i=0;i<top;++i)
		r[stk[i]]=n;
	for(int i=1;i<=n;++i)
		ans+=(long long)(r[i]-i+1)*(i-l[i]+1)*a[i];
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result