Submission #2873076

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int N;
int a[200010];

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  int pos[200010];
  for (int i = 0; i < N; i++) {
    pos[a[i] - 1] = i;
  }
  set<int> st;
  st.insert(-1);
  st.insert(N);
  ll ans = 0;
  for (int i = 0; i < N; i++) {
    int L = pos[i] - *(--st.lower_bound(pos[i]));
    int R = *(st.upper_bound(pos[i])) - pos[i];
    ans += (ll)L * R * (i + 1);
    st.insert(pos[i]);
  }
  cout << ans << endl;

  return 0;
}

Submission Info

Judge Result