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: Time Limit Exceeded)

#include <iostream>
using namespace std;

typedef long long lint;
lint A[200000];
int N;

lint sum(int l,int r){
    if(l==r) return A[l];

    lint min=200001;
    int im;
    for(int i=l;i<=r;i++){
        if(A[i]<min){ min=A[i]; im=i; }
    }
    lint s=0;
    for(int i=1;i<=r-l+1;i++){
        lint left=(l>im-i+1?l:im-i+1),right=(im<r-i+1?im:r-i+1);
        s+=right-left+1;
    }
    return min*s+(im>l?sum(l,im-1):0)+(im<r?sum(im+1,r):0);    
}
int main(){
    cin >> N;
    for(int i=0;i<N;i++) cin >> A[i];

    cout << sum(0,N-1) << endl;

    return 0;
}//