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# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCoder
{
    class Program
    {
        static void Main(string[] args)
        {
            new B();
        }
    }

    class A
    {
        public A()
        {
            var str = Console.ReadLine();
            int cntS = 0;
            int cntT = 0;
            int amaruT = 0;
            foreach (var e in str)
            {
                if (e == 'S')
                    cntS++;
                else
                    cntT++;

                if (e == 'T' && cntS < cntT - amaruT)
                {
                    amaruT++;
                }
            }
            Console.WriteLine(amaruT * 2);
        }
    }
    class B
    {
        public B()
        {
            int N = int.Parse(Console.ReadLine());
            var str = Console.ReadLine().Split(' ');
            int[] a = new int[N];
            for (int i = 0; i < N; i++)
            {
                a[i] = int.Parse(str[i]);
            }

            long sum = 0;
            for (int i = 0; i < N; i++)
            {
                int l, r;
                l = r = i;
                while(l>=0 && a[i]<=a[l])
                {
                    l--;
                }
                while (r<N && a[i]<=a[r])
                {
                    r++;
                }
                sum += a[i]*(i - l) * (r - i);
            }

            Console.WriteLine(sum);
        }
    }
}