CodeForces 610B Vika and Squares

B - Vika and Squares

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 610B

Description

Vika has n jars with paints of distinct colors. All the jars are numbered from 1 to n and the i-th jar contains a_i liters of paint of color i.

Vika also has an infinitely long rectangular piece of paper of width 1, consisting of squares of size 1 × 1. Squares are numbered 1, 2, 3and so on. Vika decided that she will start painting squares one by one from left to right, starting from the square number 1 and some arbitrary color. If the square was painted in color x, then the next square will be painted in color x + 1. In case of x = n, next square is painted in color 1. If there is no more paint of the color Vika wants to use now, then she stops.

Square is always painted in only one color, and it takes exactly 1 liter of paint. Your task is to calculate the maximum number of squares that might be painted, if Vika chooses right color to paint the first square.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 200 000) — the number of jars with colors Vika has.

The second line of the input contains a sequence of integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹), where a_i is equal to the number of liters of paint in the i-th jar, i.e. the number of liters of color i that Vika has.

Output

The only line of the output should contain a single integer — the maximum number of squares that Vika can paint if she follows the rules described above.

Sample Input

Input

5
2 4 2 3 3

Output

12

Input

3
5 5 5

Output

15

Input

6
10 10 10 1 10 10

Output

11

Hint

In the first sample the best strategy is to start painting using color 4. Then the squares will be painted in the following colors (from left to right): 4, 5, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5.

In the second sample Vika can start to paint using any color.

In the third sample Vika should start painting using color number 5.

题意：输入n表示有n种颜色，下一行n个数表示每种颜色的个数，然后你必须按顺序涂色，问你最多可以涂多少次。（颜色没有了就不可以涂了，断了的话，后面的也就不能够用了）

这个题其实还不是很难想的。

思路：找到最小值，然后这些所有的最小值中最大的间隔就是还可以继续涂的，所以答案就是这个数列中的最小值*n+这些最小值之间的最大间隔。

注意：

1.如果最小值在数列中的位置是i，j那么间隔是j-i-1，而不是j-i；

2.注意第一个最小值和最后一个最小值之间也是有间隔的！只不过比较特殊而已，需要特殊计算。

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int MAXN=200000+5;
const int inf=1000000000;
int a[MAXN];
int b[MAXN];
int n,x;
int main()
{
    int i;
    scanf("%d",&n);
    int pos=0;
    int mm=inf;
    int cnt=0;
    for(i=0;i<n;++i)
    {
        scanf("%d",&a[i]);
        if(a[i]<mm)//第一个最小值
        {
            mm=a[i];
            pos=i;
        }
    }
    b[cnt++]=pos;//b数组记录最小值的位置
    for(i=pos+1;i<n;++i)if(a[i]==mm)b[cnt++]=i;
    long long sum=(long long)mm*n;//一定要用long long
//寻找最大间隔
     mm=0;
    for(i=1;i<cnt;++i)
    {
        mm=max(mm,b[i]-b[i-1]-1);
    }
    mm=max(mm,b[0]+n-1-b[cnt-1]);
    printf("%lld\n",sum+mm);
    return 0;
}