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.*;
class Main
{
    public static void main (String[] args)
    {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long ans = 0;
        long[] a = new long[n];
        for(int i = 0; i < n; i++)
            a[i] = sc.nextLong();
        for(int i = 0; i < n; i++){
            int j = i, lcnt = 0, rcnt = 0;
            while(j >= 0 && a[j] >= a[i]){
                lcnt++;
                j--;
            }
            j = i;
            while(j < n && a[i] <= a[j]){
                rcnt++;
                j++;
            }
            ans += lcnt * rcnt * a[i];
        }
        System.out.println(ans);
    }
}