zoukankan      html  css  js  c++  java
  • CF Soldier and Badges (贪心)

    Soldier and Badges
    time limit per test
    3 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 test(s)
    input
    4
    1 3 1 4
    output
    1
    input
    5
    1 2 3 2 5
    output
    2



    可以得出一个简单的结论,如果有相同的几个出现,那么重复这几个一定要改变,而且只能增大,所以把每一个增大到距离它最近的没有用过那个位置。至于为什么这样的贪心策略是对的。。。。我也不知道,感觉罢了。
     1 #include <iostream>
     2 #include <fstream>
     3 #include <cstdio>
     4 #include <string>
     5 #include <queue>
     6 #include <vector>
     7 #include <map>
     8 #include <algorithm>
     9 #include <cstring>
    10 #include <cctype>
    11 #include <cstdlib>
    12 #include <cmath>
    13 #include <ctime>
    14 using    namespace    std;
    15 
    16 const    int    SIZE = 3005;
    17 bool    HAVE[SIZE + SIZE];
    18 int    N,D_P;
    19 int    S[SIZE],DEAL[SIZE];
    20 vector<int>    CHOOSE[SIZE];
    21 
    22 int    main(void)
    23 {
    24     scanf("%d",&N);
    25     for(int i = 0;i < N;i ++)
    26     {
    27         scanf("%d",&S[i]);
    28         if(HAVE[S[i]])
    29             DEAL[D_P ++] = S[i];
    30         else
    31             HAVE[S[i]] = true;
    32     }
    33 
    34     int    ans = 0;
    35     for(int i = 0;i < D_P;i ++)
    36         for(int j = DEAL[i] + 1;;j ++)
    37             if(!HAVE[j])
    38             {
    39                 ans += j - DEAL[i];
    40                 HAVE[j] = true;
    41                 break;
    42             }
    43     printf("%d
    ",ans);
    44 
    45 
    46     return 0;
    47 }
  • 相关阅读:
    纯前端导出Excel表格
    vue 组件按需引用,vue-router懒加载,vue打包优化,加载动画
    解决图片循环展示间距
    微信小程序aes前后端加密解密交互
    判断字符串中是否包含表情
    银行卡号Luhn校验算法
    身份证校验(支持15位和18位身份证号)、邮箱校验正则
    数组去重
    bootstrap 中 css 与 javascript 的使用
    js 分页
  • 原文地址:https://www.cnblogs.com/xz816111/p/4532051.html
Copyright © 2011-2022 走看看