CodeForces 546B

Soldier and Badges

Time Limit:3000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

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.

Input
First 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.

Output
Output single integer — minimum amount of coins the colonel has to pay.

Sample Input
Input
4
1 3 1 4
Output
1
Input
5
1 2 3 2 5
Output
2
Hint
In first sample test we can increase factor of first badge by 1.

In second sample test we can increase factors of the second and the third badge by 1.

题意：
给了n个士兵coolness factor的值，用整数数列表示，现在需要让每个coolness factor都不同，使每个人的coolness factor 增加1需要1个硬币，问最少需要多少个；

做法：
桶排，然后寻找桶编号比当前大的空桶，当前桶内的元素个数减一，空桶变为不空(每个桶最后只能放一个)，根据桶的标号可以知道所需的硬币数，若当前桶全不空，则增加桶数。

代码如下：

#include <stdio.h>
#include <string.h>
#include <algorithm>
const int maxn = 6000;
int arr[maxn];

using namespace std;

int main()
{
    int n, low, high, temp, cnt, kk;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    while(scanf("%d",&n)!=EOF)
    {
        memset(arr,0,sizeof(arr));
        low = 10e9;
        high = 0;
        for(int i=0;i<n;i++){
            scanf("%d",&temp);
            arr[temp]++;
            high = max(high, temp);  //记录桶号的开端与结束
            low = min(low, temp);
        }
        cnt = 0;
        for(int i=low; i<=high; i++){
            for(int j=i+1; j<=high&&arr[i]>=2; j++){
                if(arr[j]==0){
                    arr[j]++;
                    arr[i]--;
                    cnt += j-i;
                }
            }
            kk = arr[i];
            if(kk >= 2){
                for(int k=1; k<kk; k++){
                    arr[i]--;
                    arr[++high]++;
                    cnt += high-i;
                }
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}

分割线：
——————————————————————————-
刚开始我用while 一直没对，先贴出来，稍后整理
错误代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
const int maxn = 3000 + 10;
int arr[maxn];

using namespace std;

int main()
{
    int n, low, high, temp, cnt, kk;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    while(scanf("%d",&n)!=EOF)
    {
        memset(arr,0,sizeof(arr));
        low = 10e9;
        high = 0;
        for(int i=0;i<n;i++){
            scanf("%d",&temp);
            arr[temp]++;
            high = max(high, temp);
            low = min(low, temp);
        }
        cnt = 0;
        int j = low+1;
        for(int i=low; i<=high; i++){
            while(j<=high&&arr[i]>=2){
                if(arr[j]==0){
                    arr[j]++;
                    arr[i]--;
                    cnt += j-i;
                }
                j++;
            }
            kk = arr[i];
            if(kk >= 2){
                for(int k=1; k<kk; k++){
                    arr[i]--;
                    arr[++high]++;
                    cnt += high-i;
                    j++;
                }
            }
        }
        printf("%d\n",cnt);
    }
    return 0;
}