Vika and Squares

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

Status

Practice

CodeForces 610B
Appoint description:
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 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.

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.

题意大概就是有1——>n个正方形小纸片，要进行涂颜色：输入第一行为所拥有的颜料种类。

第二行：第i个数就表示第i种颜色有多少升（用瓶吧）；并且你可以随意挑选第i种颜料从第一个小纸片开始涂，

（从1到n涂）但是接下来涂第2，3......个小纸片时，只能用第i+1，i+2......种颜料来涂，并且一个纸片用掉一瓶颜料；

从左到右涂的时候，涂到第n个纸片时，可以拐回到第1个纸片从左到右继续涂，直到遇见第i种颜料为零瓶时停止。

#include<cstdio>
int main()
{
	long long n,i,j,count=0,min,len=0;	
	int a[400100]={0};//2*n长度 
	scanf("%lld",&n);	
	for(i=1;i<=n;i++)	
	{		
		scanf("%d",&a[i]);	
		a[n+i]=a[i];	
	}
	min=a[1];	
	for(i=1;i<=n;i++)	
	{	
		if(min>a[i])		
		min=a[i];	
	}//查找最小值 
	for(i=1;i<=2*n;i++)	
	{	
		a[i]=a[i]-min;	
	}//减去最小值 
	for(i=1;i<=2*n;i++)	//从1到2×n是为了防止查到了n但还可以回到1继续查（a【1】不为0时）这时如果这段长度最大的话，从1到n查就查不出来；好好想想 
	{	
		if(a[i]!=0)	
		{			
			for(j=i;;j++)		
			{			
				if(a[j]==0)				
				break;			
			}			
			if(len<j-i)		
			{			
				len=j-i;//找最小值之间最长的距离			
			}	
			i=j;	
		}	
	}
	count=min*n+len;	
	printf("%lld\n",count);
	return 0;
}