Mafia
来源:互联网 发布:美橙域名 编辑:程序博客网 时间:2024/05/20 05:22
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
33 2 2
4
42 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).
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<queue>#include<stack>#include<math.h>#include<iostream>#include<algorithm>using namespace std;__int64 a[100010];int main(){__int64 n, sum = 0;while(scanf("%I64d",&n) != EOF){for(int i = 0; i < n; i++){scanf("%I64d",&a[i]);}sort(a,a+n);for(int i = n-1; i >= 0; i--){sum += (a[n-1]-a[i]);}if(sum >= a[n-1]){printf("%I64d\n",a[n-1]);}else{printf("%I64d\n",a[n-1] + (a[n-1]-sum + n -2)/(n - 1));}}return 0;}
- Mafia
- Mafia
- Mafia
- Mafia's life
- CodeForces 349 C. Mafia
- CF 348A Mafia
- lightoj 1219 - Mafia 贪心
- codeforces202A. Mafia【二分】
- 【CodeForces】[348A]Mafia
- CodeForces 348A Mafia
- codeforces 348A Mafia
- Codeforces 349C - Mafia
- bzoj1339: [Baltic2008]Mafia
- A. Mafia----二分答案
- BZOJ1163: [Baltic2008]Mafia
- 黑帮网游 online mafia games
- 【CF】CodeForces 348A Mafia
- N - Mafia Codeforces 348A
- 习题29 if语句
- sql server 查看表的死锁和Kill 死锁进程
- 同时抓取带时间的logcat和kernel log的方法
- SQL高级查询——50句查询(含答案)
- Lua在vs2013的配置环境以及C++如何调用lua
- Mafia
- JavaScript--全选、全不选、反选、无刷新删除、批量删除、即点即改入库(在yii框架中操作)
- 链表
- SCPPO(十二):SQL误操作如何恢复?
- android的ImageView动画自动播放
- 六、数据库优化(上)——Mysql主从复制搭建
- Android Fragment 详解 2016 干货
- 解决Eclipse发布后到tomcat后目录下没有class文件
- mysql -- 区分apk包中,java包,android包,第三方包的方法