zoukankan      html  css  js  c++  java
  • O

    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.

    Example

    Input
    4
    1 3 1 4
    Output
    1
    Input
    5
    1 2 3 2 5
    Output
    2

    Note

    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 by1.

    第一种方法:

    是从网上看到的,感觉和我的思路一样但是可以通过

     1 #include<iostream>
     2 #include<algorithm>
     3 using namespace std;
     4 const int  MAX = 3000 + 5;
     5 int a[MAX];
     6 int Mi;
     7 int N;
     8 
     9 int main()
    10 {
    11     int temp = -1;
    12     Mi = 0;
    13     cin>>N;
    14 
    15     for(int i = 0;i < N;i++)
    16         cin>>a[i];
    17     sort(a,a+N);
    18 
    19     for(int i = 0;i < N;i++)
    20     {
    21         if(a[i] > temp)
    22             temp = a[i];
    23         else
    24             Mi += ++temp - a[i];
    25     }
    26     cout<<Mi<<endl;
    27 
    28 
    29     return 0;
    30 }

     

    第二种方法:

    完全自己的思路,但是不能通过,不知道哪错了

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 #include<set>
     5 #include<iostream>
     6 #include<algorithm>
     7 
     8 using namespace std;
     9 
    10 const int  MAX = 3000 + 5;
    11 int a[MAX];
    12 int Mi;
    13 int N;
    14 
    15 void DP ( int t )
    16 {
    17     while( a[t] != -1)
    18     {
    19         Mi++;
    20         t++;
    21         if(t > N ){ cout<<" XXXX "<<endl;break;}
    22     }
    23     a[t] = t;
    24 }
    25 
    26 int main()
    27 {
    28     Mi = 0;
    29 
    30     int temp;
    31     cin>>N;
    32 
    33     memset(a,-1,sizeof(a));
    34 
    35     for(int i = 1;i <= N;i++)
    36         {
    37             cin>>temp;
    38             if( a[temp] == -1 )
    39                 a[temp] = temp;
    40             else
    41                 DP( temp );
    42         }
    43     cout<<Mi<<endl;
    44 
    45 
    46     return 0;
    47 }

     

     

  • 相关阅读:
    记一次把聊天表情包转成文件再还原的故事
    apue第九章之孤儿进程组
    Anatomy of a Database System学习笔记
    Anatomy of a Database System学习笔记
    Anatomy of a Database System学习笔记
    Anatomy of a Database System学习笔记
    Caffe学习中的一些错误记录
    接口自动化测试
    接口测试
    HTTP 协议相关
  • 原文地址:https://www.cnblogs.com/a2985812043/p/7202156.html
Copyright © 2011-2022 走看看