Vika and Squares 刷油漆

Vika and Squares

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

Vika has n jars with paints of distinct colors. All the jars are numbered from 1 to n and the i-th jar contains ai 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, 3 and 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 a1, a2, …, an (1 ≤ ai ≤ 109), where ai 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.

Examples

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
Note
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个数字，每个数字代表有ai升油漆，问从哪个数字开始，一遍一遍刷油漆，能够用掉最多的油漆。
可以转化为求两个最小值之间的最大距离，手推几组数据可以发现这几组数据都是从最小值之间的最大长度开始算起的。
然后，最小值 * n+最小值之间的最大长度=能够用掉的最多油漆。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
using namespace std;
const int  mm=1<<30;
long long  f[200010],z[200010];//f数组存数值大小，z数组存两个最小值之间的距离.
int main()
{
    int t;
    long long mixn=mm;
    cin>>t;
    memset(f,0,sizeof(f));
    memset(z,0,sizeof(z));
    for(int i=0; i<t; i++)
    {
        cin>>f[i];
        if(mixn>f[i])
            mixn=f[i];
    }
    //先找到最小的值mixn。
    int l=0,flag=0;
    for(int i=0,j=0; i<t; i++)
    {
        if(mixn==f[i])
        {
            if(j==0)
            {
                z[j++]=i;
                l=i;
            }
            else
            {
                z[j++]=i-l-1;
                l=i;
            }
        }
        flag=j;
    }   
    z[0]+=t-l-1;//将最后一个最小值与后边界的距离  加到  第一个最小值与前边界的距离上。
    sort(z,z+flag);
    cout<<mixn*t+z[flag-1]<<endl;
    return 0;
}