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 Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;
import java.math.*;
class Main{
	public static void main(String[] argsa){
		Scanner in = new Scanner(System.in);
		int N = in.nextInt();
		int[] a = new int[N+1];
		for(int i=1; i<=N; i++){
			a[i]=in.nextInt();
		}
		long ans=0;
		int prevMin=N+1;
		for(int l=1; l<=N; l++){
			prevMin = N+1;
			for(int r=l; r<=N; r++){
				prevMin=Math.min(prevMin, a[r]);
				ans += prevMin;
			}
		}
		System.out.println(ans);
	}
}