Submission #2243962

---

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];
    }
}

int main() {
    int N;
    cin >> N;
    vector<int> a(N);
    vector<P> b(N, make_pair(1, 1));
    rep(i, N) {
        cin >> a[i];
    }
    rep(i, N) {
        for (int j=i-1; j>=0; --j) {
            if (a[j] > a[i]) b[i].first++;
            else break;
        }
        for (int j=i+1; j<N; ++j) {
            if (a[j] > a[i]) b[i].second++;
            else break;
        }
    }
    ll ans = 0;
    rep(i, N) {
        ans += a[i]*b[i].first*b[i].second;
    }
    cout << ans << endl;
}

Submission Info

Judge Result