Codeforces Round #202 (Div. 2)C. Mafia(思维)
来源:互联网 发布:钢结构三维设计软件 编辑:程序博客网 时间:2024/05/16 05:03
C. Mafia
time limit per test:2 seconds
memory limit per test:256 megabytes
input:standard input
output:standard output
One day n friends gathered together to play “Mafia”. During each round of the game some player must be the supervisor and other n - 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?
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 ai rounds.
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.
Examples
Input
3
3 2 2
Output
4
Input
4
2 2 2 2
Output
3
Note
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:
题意:
n个玩游戏,游戏需要一个主持人,其他人为选手。给出n个人想成为选手的次数。问最少的游戏次数。
题解:正面去解这道题没想到办法。就换一下思维。将题目变成给你一个数问是否满足题意。很显然 次数最少大于等于max(ai)。然后判断,假设现在为k轮,总共的主持人数为sum(k-ai)(1<=i<=n),如果和大于等于k则满题意。
代码:
#include <bits/stdc++.h>#define ll long longusing namespace std;const int N=1e5+10;ll a[N];int main(){ int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%I64d",&a[i]); } sort(a+1,a+1+n); bool flag=true; ll k=a[n]; ll sum=0; for(int i=1;i<=n;i++) { sum+=(k-a[i]); } if(sum>=k) { flag=false; } while(flag) { k++; sum+=n; if(sum>=k) break; } printf("%I64d\n",k);}
- Codeforces Round #202 (Div. 2)C. Mafia(思维)
- Codeforces Round #202 (Div. 2) C. Mafia
- Codeforces Round #202 (Div. 2)C. Mafia
- cf Round #202 (div.2) C ------------ Mafia
- Codeforces Round #202 (Div. 1) A. Mafia(二分,思路)
- Codeforces Round #202 (Div. 1) A. Mafia
- Codeforces Round #202 (Div. 1) A. Mafia
- Codeforces Round #353 (Div. 2) C 思维
- Codeforces Round #261 (Div. 2)C题(思维题)
- Codeforces Round #246 (Div. 2)(C)数学,思维
- Codeforces Round #345 (Div. 2)(C)排列组合,思维
- Codeforces Round #273 (Div. 2)(C)贪心,思维
- Codeforces Round #381 (Div. 2)C(构造,思维)
- Codeforces Round #386 (Div. 2)C. Tram(模拟+思维)
- Codeforces Round #202 (Div. 1) A. Mafia 【二分】
- Codeforces Round #202 (Div. 2)(B)贪心,思维
- Codeforces 349C Mafia【二分+思维判定】
- Codeforces Round #400 (Div. 1 + Div. 2, combined) C:Molly's Chemicals(前缀+思维)
- 将查询出来的数据集转化成JSON格式的类
- php数组翻转
- 鸡汤书单
- 面向对象
- 该写地址的地方, 却写了变量本身, 产生core, 导致系统异常
- Codeforces Round #202 (Div. 2)C. Mafia(思维)
- 《国王的演讲》
- 多态
- PEDA用法总结
- Linux服务器使用df和du查看磁盘大小不一致的问题和解决办法
- Activity生命周期
- 10、get和post的区别
- 理解事务的ACID和隔离级别
- 协议森林07 傀儡 (UDP协议)