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: Wrong Answer)

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		new Main().solve();
	}
	
	void solve(){
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		long[]a=new long[n];
		for(int i=0;i<n;i++){
			a[i]=sc.nextLong();
		}
		int[] count=new int[n];
		for(int i=0;i<n;i++){
			int left=1;
			int right=1;
			while(i-left>=0 && a[i-left]>a[i]){
				left++;
			}
			while(i+right<=n-1 && a[i+right]>a[i]){
				right++;
			}
			count[i]=right*left;
		}
		long ans=0;
		for(int i=0;i<n;i++){
			ans+=a[i]*count[i];
		}
		System.out.println(ans);
	}
}