CF 546 B. Soldier and Badges
来源:互联网 发布:淘宝旺旺号在哪里看 编辑:程序博客网 时间:2024/05/16 16:15
click here ~~
***B. Soldier and Badges***Colonel has n badges. He wants to give one badge to every of his n soldiers. Each badge has a coolness factor, which shows how much it's owner reached. Coolness factor can be increased by one for the cost of one coin.For every pair of soldiers one of them should get a badge with strictly higher factor than the second one. Exact values of their factors aren't important, they just need to have distinct factors.Colonel knows, which soldier is supposed to get which badge initially, but there is a problem. Some of badges may have the same factor of coolness. Help him and calculate how much money has to be paid for making all badges have different factors of coolness.InputFirst line of input consists of one integer n (1 ≤ n ≤ 3000).Next line consists of n integers ai (1 ≤ ai ≤ n), which stand for coolness factor of each badge.OutputOutput single integer — minimum amount of coins the colonel has to pay.
Sample test(s)
input
4
1 3 1 4
output
1
input
5
1 2 3 2 5
output
2
题目大意:就是让所有的数不相等,所需要的操作数
样例解析:
Input:
4
1 3 1 4
Output:
1
先排一下序:1 1 3 4
所以不相等的话只需要第二个数+1
变为: 1 2 3 4
所以操作数 == 1
具体见代码:
上代码:
/*Date : 2015-09-03 晚上Author : ITAKMotto :今日的我要超越昨日的我,明日的我要胜过今日的我;以创作出更好的代码为目标,不断地超越自己。*/#include <iostream>#include <cstdio>#include <algorithm>using namespace std;int arr[3005];int main(){ int n; while(~scanf("%d", &n)) { for(int i=0; i<n; i++) scanf("%d", &arr[i]); sort(arr, arr+n); int sum = 0; for(int i=0; i<n; i++) { if(arr[i-1] >= arr[i]) { sum += arr[i-1] - arr[i] + 1; arr[i] += arr[i-1] -arr[i] + 1; } } printf("%d\n",sum); } return 0;}
0 0
- CF 546B Soldier and Badges
- CF 546 B. Soldier and Badges
- Soldier and Badges(546B)
- 546B. Soldier and Badges
- B. Soldier and Badges
- coderforce 546 B. Soldier and Badges
- CodeForces-546B-Soldier and Badges
- 【codeforces 546B】Soldier and Badges
- codeforces 546B Soldier and Badges
- cf#304-B. Soldier and Badges-暴力贪心
- CodeForces 546B - Soldier and Badges(模拟)
- codeforce 304 B. Soldier and Badges
- Codeforces546B:Soldier and Badges
- Soldier and Badges
- Soldier and Badges
- Codeforces546B Soldier and Badges
- Codeforces Round #304 (Div. 2) B.Soldier and Badges
- B - Soldier and Badges (CF546B) Codeforces Round #304 (Div. 2)
- HDU 2083 简易版之最短距离(水)
- c#中的delegate(委托)和event(事件)
- windows下用cocos2d-x创建新项目
- duilib : (工程)内嵌网页加载完,设置焦点
- Swift 学习笔记 3-控制流
- CF 546 B. Soldier and Badges
- HUD Average 5353模拟
- 每日编程2
- 简单的内存分析
- python 错误集
- Cocos2d-ObjC的Action
- 伪代码的格式
- Swift之闭包
- 字符编码