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 ai 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 ≤ 105). The second line contains n space-separated integers a1, a2, ..., an(1 ≤ ai ≤ 109) — 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 airounds.
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
3 3 2 2
4
4 2 2 2 2
3
Hint
You don't need to know the rules of "Mafia" to solve this problem. If you're curious, it's a game Russia got from the Soviet times:http://en.wikipedia.org/wiki/Mafia_(party_game).
题意:有N个人玩游戏,给出每个人想赢的局数,每局中必须有一个人当裁判,剩下N-1个人比赛,问最少设多少局比赛
思路:二分查找满足条件的局数,
<pre name="code" class="cpp">#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
__int64 n,i,j,k,l,m;
while(scanf("%I64d",&n)!=EOF)
{
__int64 sum=0;
__int64 Max=0;
for(i=1;i<=n;i++)
{
scanf("%I64d",&m);
Max=max(Max,m);
sum+=m;
}
__int64 l=Max;//不能设为0
__int64 r=sum;
__int64 ans;
while(l<=r)
{
__int64 mid=(l+r)/2;
if(mid*n-sum>=mid)
{
ans=mid;
r=mid-1;
}
else
l=mid+1;
}
printf("%I64d\n",ans);
}
return 0;
}