Problem:
Score : 400 points

Problem Statement

One day, Snuke was given a permutation of length N, a_1, a_2, ..., a_N, from his friend.

Find the following:

Constraints

1 ≦ N ≦ 200,000

(a_1, a_2, ..., a_N) is a permutation of (1, 2, ..., N).

Input

The input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

Print the answer.

Note that the answer may not fit into a 32-bit integer.

Sample Input 1

3
2 1 3

Sample Output 1

9

Sample Input 2

4
1 3 2 4

Sample Output 2

19

Sample Input 3

8
5 4 8 1 2 6 7 3

Sample Output 3

85

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long lli;
lli n;
vector<lli> a;
map<lli,lli> m;
set<lli> s;
lli ans = 0;
int main(int argc, char const *argv[]) {
    cin >> n;
    a = vector<lli> (n+2);
    for(lli i = 1;i <= n;i++){
        lli a;
        cin >> a;
        m[a] = i;
    }
    s.insert(0);s.insert(n+1);
    for(lli i = 1;i <= n;i++){
        auto itr = s.lower_bound(m[i]);
        lli x = *itr - m[i];
        itr--;
        lli y = m[i] - *itr;
        s.insert(m[i]);
        ans += x * y * i;
    }
    cout << ans << endl;

    return 0;
}