Submission #2244076

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

ll ind[200100];

int main() {
    ll N;
    cin >> N;
    rep(i, N) {
        ll a;
        cin >> a;
        ind[a] = i;
    }
    set<ll> st;
    st.insert(-1);
    st.insert(N);
    ll ans = 0;
    for (ll i=1; i<=N; ++i) {
        st.insert(ind[i]);
        ll l = *(--st.find(ind[i]));
        ll r = *(++st.find(ind[i]));
        //cout << ind[i] << " " << l << ", " << ind[r] << " " << r << endl;
        ans += i * (ind[i]-l) * (r-ind[i]);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result