CF631E.Product Sum

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

Blake is the boss of Kris, however, this doesn't spoil their friendship. They often gather at the bar to talk about intriguing problems about maximising some values. This time the problem is really special.

You are given an array $a$ of length $n$ . The characteristic of this array is the value — the sum of the products of the values $a_{i}$ by $i$ . One may perform the following operation exactly once: pick some element of the array and move to any position. In particular, it's allowed to move the element to the beginning or to the end of the array. Also, it's allowed to put it back to the initial position. The goal is to get the array with the maximum possible value of characteristic.

输入格式

The first line of the input contains a single integer $n$ ( $2<=n<=200000$ ) — the size of the array $a$ .

The second line contains $n$ integers $a_{i}$ ( $1<=i<=n$ , $|a_{i}|<=1000000$ ) — the elements of the array $a$ .

输出格式

Print a single integer — the maximum possible value of characteristic of $a$ that can be obtained by performing no more than one move.

输入输出样例

输入#1
```
4
4 3 2 5
```
输出#1
```
39
```
输入#2
```
5
1 1 2 7 1
```
输出#2
```
49
```
输入#3
```
3
1 1 2
```
输出#3
```
9
```

说明/提示

In the first sample, one may pick the first element and place it before the third (before $5$ ). Thus, the answer will be $3·1+2·2+4·3+5·4=39$ .

In the second sample, one may pick the fifth element of the array and place it before the third. The answer will be $1·1+1·2+1·3+2·4+7·5=49$ .

首页