zoukankan      html  css  js  c++  java
  • 2015 HUAS Provincial Select Contest #1

    Description

    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.

    解题思路:这个题目其实是看有多少个相同的数字,如果相同就要进行一定的运算将其转换成不同的数。但是每一次案例都要记得清零,不然会出现错误。

    程序代码:

    #include<cstdio>
    #include<algorithm>
    using namespace std;
    int main()
    {
     int n,i,a[3000];
      
     while(scanf("%d",&n)==1)
     {
        int count=0;
     for( i=0;i<n;i++)
             scanf("%d",&a[i]);
     sort(a,a+n);
      for(int j=1;j<n;j++)
      {
                     if(a[j]<=a[j-1])
                     {
                        count+=a[j-1]-a[j]+1;
                       a[j]+=a[j-1]-a[j]+1;
         }
      }
      printf("%d ",count);
     } 
     return 0;
    }

  • 相关阅读:
    名言
    八猫图
    springMVC 上传下载文件
    mongdb 模糊查询
    tomcat结合nginx使用小结
    orale存储过程
    java执行效率低,但效率就低吗?
    Spring aop 原始的工作原理的理解
    spring aop一些名词的理解
    Spring控制反转(IOC)和依赖注入(DI),再记不住就去出家!
  • 原文地址:https://www.cnblogs.com/chenchunhui/p/4659835.html
Copyright © 2011-2022 走看看