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

macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String {
            bytes
                .by_ref()
                .map(|r| r.unwrap() as char)
                .skip_while(|c| c.is_whitespace())
                .take_while(|c| !c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{min, max};

fn main() {
    input!{
        n: usize,
        v: [usize; n]
    }
    let mut segt = SegT::from_vec(&v, usize::max_value(), |x, y| x + y, min);
    let mut ans = 0;
    for i in 0..n {
        let l = binary_search(0, i, |m| segt.get(m, i) >= v[i]);
        let r = binary_search(i, n, |m| segt.get(i, m) < v[i]);
        ans += (i - l + 1) * (r - i) * v[i];
    }
    println!("{}", ans);
}

fn binary_search<F>(mut l: usize, mut r: usize, mut f: F) -> usize where F: FnMut(usize) -> bool {
    if f(l) {
        return l;
    }
    while l + 1 < r {
        let m = (l + r) / 2;
        if f(m) {
            r = m;
        } else {
            l = m;
        }
    }
    r
}

struct SegT<T, F, G> where T: Copy, F: FnMut(T, T) -> T, G: FnMut(T, T) -> T {
    n: usize,
    v: Vec<T>,
    def: T,
    upf: F,
    getf: G
}

impl<T, F, G> SegT<T, F, G> where T: Copy, F: FnMut(T, T) -> T, G: FnMut(T, T) -> T {
    fn new(n: usize, def: T, upf: F, getf: G) -> SegT<T, F, G> {
        let mut s = 1;
        while s < n {
            s *= 2;
        }
        SegT{n: s, v: vec![def; 2 * s - 1], def: def, upf: upf, getf: getf}
    }

    fn from_vec(xs: &Vec<T>, def: T, upf: F, mut getf: G) -> SegT<T, F, G> {
        let l = xs.len();
        let mut s = 1;
        while s < l {
            s *= 2;
        }
        let mut v: Vec<T> = vec![def; 2 * s - 1];
        for i in 0..l {
            v[i + s - 1] = xs[i];
        }
        for i in 2..s + 1 {
            let p = s - i;
            v[p] = getf(v[2 * p + 1], v[2 * p + 2]);
        }
        SegT{n: s, v: v, def: def, upf: upf, getf: getf}
    }

    fn update(&mut self, i: usize, x: T) {
        let n = self.n;
        self.update_rec(i, x, 0, 0, n - 1);
    }

    fn update_rec(&mut self, i: usize, x: T, p: usize, pl: usize, pr: usize) {
        if pl > i || pr < i {
            return;
        } else if p == i + self.n - 1 {
            self.v[p] = (self.upf)(self.v[i], x);
        } else {
            self.update_rec(i, x, 2 * p + 1, pl, (pl + pr - 1) / 2);
            self.update_rec(i, x, 2 * p + 2, (pl + pr + 1) / 2, pr);
            self.v[p] = (self.getf)(self.v[2 * p + 1], self.v[2 * p + 2]);
        }
    }

    fn get(&mut self, l: usize, r: usize) -> T {
        let n = self.n;
        self.get_rec(l, r, 0, 0, n - 1)
    }

    fn get_rec(&mut self, l: usize, r: usize, p: usize, pl: usize, pr: usize) -> T {
        if pl > r || pr < l {
            self.def
        } else if l <= pl && pr <= r {
            self.v[p]
        } else {
            let a = self.get_rec(l, r, 2 * p + 1, pl, (pl + pr - 1) / 2);
            let b = self.get_rec(l, r, 2 * p + 2, (pl + pr + 1) / 2, pr);
            (self.getf)(a, b)
        }
    }
}