Coderforces 348A

Mafia

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

Submit  Status  Practice  CodeForces 348A

Description

One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and other n - 1people take part in the game. For each person we know in how many rounds he wants to be a player, not the supervisor: the i-th person wants to play a_i rounds. What is the minimum number of rounds of the "Mafia" game they need to play to let each person play at least as many rounds as they want?

Input

The first line contains integer n (3 ≤ n ≤ 10⁵). The second line contains n space-separated integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — the i-th number in the list is the number of rounds the i-th person wants to play.

Output

In a single line print a single integer — the minimum number of game rounds the friends need to let the i-th person play at least a_irounds.

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64dspecifier.

Sample Input

Input

3
3 2 2

Output

4

Input

4
2 2 2 2

Output

3

题意：n个人玩游戏每场游戏都要出来一个人主持，其他n-1个人玩，给出每个人都想玩游戏的场数，问在满足每个人的要求的情况下最少需要举行多少场游戏？

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int MAX=100005;
long long a[MAX];
long long n;
bool judge(long long mid)
{
	long long i,sum=0;
	for(i=0;i<n;i++)
	{
		if(a[i]>mid)
		  return false;
		sum+=mid-a[i];//表示在满足每个人的需求外，每个人能出来主持游戏的场数之和；
		//if(sum>=mid)//不能写，出错！！！！ 若写的话，需要排序;
		 // return true;
	}
	return sum>=mid;//若每个人出来主持游戏的场数之和大于举行游戏场数之和，满足题意，是一个解；
}
int main()
{
	while(scanf("%lld",&n)!=EOF)
	{
		long long i,r=0;
		for(i=0;i<n;i++)
		{
			scanf("%lld",&a[i]);
			r+=a[i];
		}
		long long l=0,ans=0;
		while(l<=r)
		{
			long long mid=(l+r)>>1;
			if(judge(mid))
			{
				r=mid-1;
				ans=mid;
			}
			else
			{
				l=mid+1;
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}