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 PyPy3 (2.4.0) (judge verdict: Time Limit Exceeded)

n = int(input())
a = list(map(int, input().split()))

ans = 0
for i in range(n):
    s = 0
    e = n-1
    for j in range(i):
        if a[i]>a[i-j-1]:
            s = i-j
            break
    for j in range(i+1,n):
        if a[i]>a[j]:
            e = j-1
            break
    ans += (i-s+1)*(e-i+1)*a[i]

print(ans)