Submission #1102173

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j,n;
  cin>>n;

  vi a(n),order(n);
  rep(i,n)cin>>a[i];
  rep(i,n)order[a[i]-1]=i;

  set<int> st;
  st.insert(-1);
  st.insert(n);

  ll ans=0;
  rep(i,n){
    set<int>::iterator itr=st.lower_bound(order[i]);
    ll right=(*itr)-order[i];
    itr--;
    ll left=order[i]-(*itr);
    ll tmp=a[order[i]]*left*right;
    ans+=tmp;
    st.insert(order[i]);
  }
  cout<<ans<<endl;
}

Submission Info

Judge Result