• Codeforces_723_C


    http://codeforces.com/problemset/problem/723/C

    将n个数替换为1-m内的数,使得1-m的个数的最小值最大,并且替换步骤最少。注意,不必将每个数都替换!!

    #include<iostream>
    #include<cstring>
    #include<cstdio>
    #include<algorithm>
    #include<cmath>
    #define INF 0x3f3f3f3f
    using namespace std;
    
    int a[2005],b[2005] = {0};
    
    int main()
    {
        int m,n;
        scanf("%d%d",&n,&m);
        for(int i = 1;i <= n;i++)
        {        
            scanf("%d",&a[i]);    
            if(a[i] <= m)    b[a[i]]++;
        }
        int ans = n/m;
        int cnt = 0;    
        for(int i = 1;i <= n;i++)
        {
            if(a[i] > m || a[i] <= m && b[a[i]] > ans)
            {
                int j;
                for(j = 1;j <= m;j++)
                {
                    if(b[j] < ans)    break;
                }
                if(j == m+1)    break;
                if(a[i] <= m)    b[a[i]]--;
                a[i] = j;
                b[j]++;
                num++;
            }
        }    
        printf("%d %d
    ",ans,num);
        int flag = 1;
        for(int i = 1;i <= n;i++)
        {
            if(flag)
            {
                printf("%d",a[i]);
                flag = 0;
            }
            else
            {
                printf(" %d",a[i]);
            }
        }
        printf("
    ");
        return 0;
    }
        
  • 相关阅读:
    kubenetes-学习
    k8s-字段
    Spring Boot集成mongodb
    synchronized关键字
    Scala手记
    Python数据结构&封装解构
    Scala基础之集合
    Scala基础之集合常用方法
    Scala(2.12)之collection基本操作
    Scala基础之集合(数组)
  • 原文地址:https://www.cnblogs.com/zhurb/p/5929935.html
Copyright © 2020-2023  润新知