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?
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.
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.
3 3 2 2
4
4 2 2 2 2
3
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).
题目链接:http://codeforces.com/contest/348/problem/A
就说cf的出题人热衷于二分答案
这个题的意思是说有一个游戏,每轮需要一个裁判(不知道是什么,意思就是每轮有一个人不能参加),第i个人想玩啊a[i]局游戏,问最少需要几局才能满足每个人的条件。
多明显的二分答案啊。。。
代码:
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
int n;
LL sum=0;
bool judge(LL mid){
if(mid*(n-1)>=sum)//每一局只能有n-1个人参加游戏
return true;
return false;
}
int main(){
LL l=0,r=0;
scanf("%d",&n);
for(int i=0;i<n;i++){
LL a;
scanf("%I64d",&a);
l=max(a,l);
r+=a;
sum+=a;
}
while(l<r){
LL mid=(l+r)/2;
if(judge(mid))
r=mid;
else
l=mid+1;
}
printf("%I64d\n",r);
return 0;
}