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 C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main() {
	int N;
	scanf ("%d", &N);
	int a[N], b[N];
	for (int i=0; i<N; i++) {
		scanf ("%d", &a[i]);
		b[i]=1;
	}
	long long sum=0;
	for (int i=0; i<N; i++) {
		for (int j=i; j<N; j++) {
			if (a[i] <= a[j]) {
				sum += a[i]*b[i];
			} else {
				b[j]+=b[i];
				break;
			}
		}
	}
	printf ("%lld", sum);
	return 0;
}