跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0727. Imbalanced Array

    ID: 733 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 6 上传者: 标签>数据结构分治并查集排序算法思想编程与模拟提高难度共享题库Codeforces英文题面题目来源题面语言

Imbalanced Array

题目描述

D. Imbalanced Array
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given an array a consisting of n elements. The imbalance value of some subsegment of this array is the difference between the maximum and minimum element from this segment. The imbalance value of the array is the sum of imbalance values of all subsegments of this array.

For example, the imbalance value of array [1,4,1] is 9, because there are 6 different subsegments of this array:

  • [1] (from index 1 to index 1), imbalance value is 0;
  • [1,4] (from index 1 to index 2), imbalance value is 3;
  • [1,4,1] (from index 1 to index 3), imbalance value is 3;
  • [4] (from index 2 to index 2), imbalance value is 0;
  • [4,1] (from index 2 to index 3), imbalance value is 3;
  • [1] (from index 3 to index 3), imbalance value is 0;

You have to determine the imbalance value of the array a.

Input

The first line contains one integer n (1≤n≤106) − size of the array a.

The second line contains n integers a1,a2... an (1≤ai≤106) − elements of the array.

Output

Print one integer − the imbalance value of a.

Example
Input
3
1 4 1
Output
9


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 145 题。保留原作者与原赛事署名。