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

#include <stdio.h>

int main(void) {
	int arr[200000];
	int n;
	long long int total = 0;
	int i, l, r, m;

	scanf("%d", &n);
	for (i = 0; i < n; i++) {
		scanf("%d", &arr[i]);
	}

	for (l = 0; l < n; l++) {
		m = arr[l];
		total += m;
		for (r = l + 1; r < n; r++) {
			if (m == 1) {
				total += n - r;
				break;
			}
			else if (m > arr[r]) {
				m = arr[r];
			}
			total += m;
		}
	}

	printf("%lld\n", total);
}