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

import bisect
n = int(input())
a = [int(i) for i in input().split()]
b = [0 for i in range(n)]
for i in range(n): b[a[i]-1] = i
ans,c = (b[0]+1)*(n-b[0]),[b[0]]
for i in range(1,n):
	x = bisect.bisect_left(c,b[i])
	if 0<x<len(c): ans += (c[x]-b[i])*(b[i]-c[x-1])*(i+1)
	elif x==0: ans += (c[0]-b[i])*(b[i]+1)*(i+1)
	elif x==len(c): ans += (b[i]-c[-1])*(n-b[i])*(i+1)
	bisect.insort_left(c,b[i])
print(ans)