B - Soldier and Badges (CF546B) Codeforces Round #304 (Div. 2)
来源:互联网 发布:unity3d vs 编辑:程序博客网 时间:2024/06/09 20:23
题意:给你n堆价值,要求得到每堆价值是独一无二的,问你往每堆加多少,最少加多少。
思路:(贪心)先排序,然后以第一个为基准,后面的不大于前面的,就加加;
转载请注明出处:寻找&星空の孩子
题目链接:http://codeforces.com/contest/546/problem/B
#include <iostream>#include <stdio.h>#include <string.h>#include <string>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <math.h>#include <bitset>#include <list>#include <algorithm>#include <climits>using namespace std;#define lson 2*i#define rson 2*i+1#define LS l,mid,lson#define RS mid+1,r,rson#define UP(i,x,y) for(i=x;i<=y;i++)#define DOWN(i,x,y) for(i=x;i>=y;i--)#define MEM(a,x) memset(a,x,sizeof(a))#define W(a) while(a)#define gcd(a,b) __gcd(a,b)#define LL long long#define N 5000005#define INF 0x3f3f3f3f#define EXP 1e-8#define lowbit(x) (x&-x)const int mod = 1e9+7;#define LL __int64int n,a[3005];int main(){ int i,j,ans; while(~scanf("%d",&n)) { ans = 0; int sum1 = 0,sum2 = 0; for(i = 1; i<=n; i++) { scanf("%d",&a[i]); sum1+=a[i]; } sort(a+1,a+1+n); sum2 = a[1]; for(i = 2; i<=n; i++) { if(a[i] == a[i-1]) a[i]++; else if(a[i]<a[i-1]) a[i] +=(a[i-1]-a[i])+1; sum2+=a[i]; } printf("%d\n",sum2-sum1); } return 0;}
0 0
- B - Soldier and Badges (CF546B) Codeforces Round #304 (Div. 2)
- Codeforces-B.Soldier and Badges - Codeforces Round #304 (Div. 2)
- Codeforces Round #304 (Div. 2) B.Soldier and Badges
- CodeForces-546B-Soldier and Badges
- 【codeforces 546B】Soldier and Badges
- codeforces 546B Soldier and Badges
- B. Soldier and Badges
- codeforce 304 B. Soldier and Badges
- Codeforces Round #304 (Div. 2) E. Soldier and Traveling
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game
- Codeforces Round #304 (Div. 2) C Soldier and Cards
- Codeforces Round #304 (Div. 2) D Soldier and Number Game
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game
- A. Soldier and Bananas(CF546) Codeforces Round #304 (Div. 2)
- E. Soldier and Traveling(CF546E) Codeforces Round #304 (Div. 2)
- Codeforces Round #304 (Div. 2) D - Soldier and Number Game
- Codeforces Round #304 (Div. 2)D. Soldier and Number Game
- Codeforces Round #304 (Div. 2)-E. Soldier and Traveling
- app store相关
- 抽签问题或是超几何概率
- in与exist , not in与not exist 的区别
- 图像处理(十九)基于移动最小二乘的图像变形-Siggraph 2006
- AVFormatContext
- B - Soldier and Badges (CF546B) Codeforces Round #304 (Div. 2)
- Auto Layout NSLayoutConstraint 界面布局
- jQuery uploadify3.2 属性里没有cancelImg或cancelImage属性
- Java中的静态块语句、块语句精研
- Android 背景模糊专题
- 分支-12 计算火车运行时间(15)
- 得分(Score, ACM/ICPC Seoul 2005, UVa 1585)
- linux常用命令大全(转)
- 解决 SharePoint 2013 An update conflict has occurred, and you must re-try this action