Submission #1591052

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<P> d;
    for(int i = 0; i < n; i++){
        int a; cin >> a;
        d. push_back((P(a, i)));
    }
    sort(all(d));
    int ans = 0;
    set<int> st;
    st.insert(-1);
    st.insert(n);
    rep(i, 0, n){
        st.insert(d[i].second);
        auto it = st.find(d[i].second);
        it++;
        int right = *it;
        it--; it--;
        int left = *it;
        int tmp = (right - d[i].second) * (d[i].second - left);
        ans += tmp * d[i].first;
        // cout << right << ' ' << left << ' ' << tmp << endl;
    }
    cout << ans << endl;
}

Submission Info

Judge Result