思路:(贪心)先排序,然后以第一个为基准,后面的不大于前面的,就加加;
转载请注明出处:寻找&星空の孩子
题目链接: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 __int64
int 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;
}