https://codeforces.com/contest/1102/problem/B

題解：

/* *@Author: STZG *@Language: C++ */ #include <bits/stdc++.h> #include<iostream> #include<algorithm> #include<cstdlib> #include<cstring> #include<cstdio> #include<string> #include<vector> #include<bitset> #include<queue> #include<deque> #include<stack> #include<cmath> #include<list> #include<map> #include<set> //#define DEBUG #define RI register int using namespace std; typedef long long ll; //typedef __int128 lll; const int N=100000+10; const int MOD=1e9+7; const double PI = acos(-1.0); const double EXP = 1E-8; const int INF = 0x3f3f3f3f; int t,n,m,k,q; int ans,cnt,flag,temp; int a[N]; int sum[N]; int c[N]; vector<int>vec[N]; int hgf; char str; map<int,int>p; int main() { #ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout); #endifscanf("%d%d",&n,&k);for (int i=1;i<=n;++i){scanf("%d",&a[i]);sum[a[i]]++;}for (int i=1;i<=5000;++i){if (sum[i]>k){printf("NO\n");return 0;}}printf("YES\n");hgf=1;for (int i=1;i<=n;++i){if (hgf<=k&&c[a[i]]==0){printf("%d ",hgf);vec[a[i]].push_back(hgf);hgf++;}else{int flag=1;while (flag){c[a[i]]++;if (!vec[a[i]].empty()){for (int j=vec[a[i]].size()-1;j>=0;--j){if (c[a[i]]==vec[a[i]][j]){flag=1;break;}flag=0;}}else flag=0;}printf("%d ",c[a[i]]);}}//cout << "Hello world!" << endl;return 0; }

?

總結

以上是生活随笔為你收集整理的Array K-Coloring的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。