Submission #1680988

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
#include <tuple>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;

#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = 1e12;
const ll MOD = 1e9 + 7;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1

ll n, a[200100];
ll pos[200100];

int main() {
	cin >> n;
	rep(i, n) {
		cin >> a[i];
		pos[a[i] - 1] = i;
	}
	ll ans = 0;
	set<ll> sl;
	sl.insert(-1);
	sl.insert(n);
	rep(i, n) {
		set<ll>::iterator it = sl.upper_bound(pos[i]);
		it--;
		set<ll>::iterator it2 = it;
		it++;
		ans += (i + 1)*(pos[i] - *it2)*(*it - pos[i]);
		sl.insert(pos[i]);
	}
	cout << ans << endl;
}

Submission Info

Judge Result