Submission #2861985

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
#include<set>
using namespace std;
int mod = 1e9+7;

int main() {
  int n;
  cin >> n;
  vector<long long int> a(n+1);
  for(int i=0; i<n; i++){
    long long int tmp;
    cin >> tmp;
    a[tmp] = i;
  }

  long long int ans = 0;
  set<long long int> s;
  s.insert(-1);
  s.insert(n);
  for(int i=1; i<=n; i++){
    long long int p = a[i];
    auto it = s.lower_bound(p);
    long long int r = *it;
    it--;
    long long int l = *it;
    ans += i * (p-l) * (r-p);
    s.insert(p);
  }

  cout << ans << endl;

  return 0;
}

//

Submission Info

Judge Result