Submission #1475168

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N; cin >> N;
	vector<int> pos(N);
	vector<int> a(N); rep(i, 0, N) {
		cin >> a[i]; a[i]--;
		pos[a[i]] = i;
	}
	set<int> st;
	st.insert(-1); st.insert(N);
	int ans = 0;
	rep(k, 0, N) {
		auto res = st.insert(pos[k]);
		set<int>::iterator l, r;
		l = r = res.first;
		l--; r++;
		ans += (k + 1)*(pos[k] - *l)*(*r - pos[k]);
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result