CF442C.Artem and Array

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Artem has an array of $n$ positive integers. Artem decided to play with it. The game consists of $n$ moves. Each move goes like this. Artem chooses some element of the array and removes it. For that, he gets $min(a,b)$ points, where $a$ and $b$ are numbers that were adjacent with the removed number. If the number doesn't have an adjacent number to the left or right, Artem doesn't get any points.

After the element is removed, the two parts of the array glue together resulting in the new array that Artem continues playing with. Borya wondered what maximum total number of points Artem can get as he plays this game.

输入格式

The first line contains a single integer $n$ $(1<=n<=5·10^{5})$ — the number of elements in the array. The next line contains $n$ integers $a_{i}$ $(1<=a_{i}<=10^{6})$ — the values of the array elements.

输出格式

In a single line print a single integer — the maximum number of points Artem can get.

输入输出样例

输入#1
```
5
3 1 5 2 6
```
输出#1
```
11
```
输入#2
```
5
1 2 3 4 5
```
输出#2
```
6
```
输入#3
```
5
1 100 101 100 1
```
输出#3
```
102
```

首页