codeforces202A. Mafia【二分】
来源:互联网 发布:excel表格怎么恢复数据 编辑:程序博客网 时间:2024/06/06 02:28
One day n friends gathered together to play "Mafia". During each round of the game some player must be the supervisor and othern - 1 people 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) — thei-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%I64d specifier.
33 2 2
4
42 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).
#include<iostream>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<cstdio>#include<queue>#include<list>#include<stack>#include<queue>using namespace std;const int maxn=100010;long long num[maxn],n;bool judge(long long mid){ long long ans=0; for(int i=1;i<=n;++i){ if(num[i]>mid)return false; ans=ans+mid-num[i]; } return ans>=mid;}int main(){ long long ans=0,left=0,right=0; scanf("%lld",&n); for(int i=1;i<=n;++i){ scanf("%lld",&num[i]); right+=num[i]; } while(left<=right){ long long mid=(left+right)>>1; if(judge(mid)){ ans=mid; right=mid-1; } else { left=mid+1; } } printf("%lld\n",ans); return 0;}
- codeforces202A. Mafia【二分】
- A. Mafia----二分答案
- Mafia
- Mafia
- Mafia
- Codeforces 348A - Mafia (二分答案)
- 【CodeForces】348A - Mafia(二分 & 思维)
- CodeForces 348A Mafia(二分)
- coderforces 348A Mafia(二分)
- Codeforces 348A:Mafia(二分+思维)
- codeforces 349C Mafia [贪心]/[二分答案]
- Codeforces 349C Mafia【二分+思维判定】
- CF#348 A. Mafia(二分,思维)
- Codeforces Round #202 (Div. 1) A. Mafia(二分,思路)
- Codeforces Round #202 (Div. 1) A. Mafia 【二分】
- Codeforces Round #202 (Div. 1) A. Mafia二分查找,玩游戏
- [二分 前缀优化建图 2-SAT] Codeforces 587D. Duff in Mafia
- [二分答案 2-SAT验证 前后缀优化建图] Codeforces 587D #326 (Div. 1) D. Duff in Mafia
- RxJava 学习笔记(一)
- Activity生命周期
- VIM编辑器中去掉windows环境下残留换行^M的方法
- GreenDao的使用详解
- Java学习笔记(12)Exception Handling and Text I/O
- codeforces202A. Mafia【二分】
- 二叉堆
- Summary Ranges
- SSL协议详解
- WebView
- 文件下载
- slurm入门
- ubuntu apt header错误
- 十大滤波算法程序大全