A - Diverse Team
Posted 霜雪千年
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了A - Diverse Team相关的知识,希望对你有一定的参考价值。
Problem description
There are n students in a school class, the rating of the i-th student on Codehorses is ai. You have to form a team consisting of k students (1≤k≤n) such that the ratings of all team members are distinct.If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print k distinct numbers which should be the indices of students in the team you form. If there are multiple answers, print any of them.
Input
The first line contains two integers n and k (1≤k≤n≤100) — the number of students and the size of the team you have to form.The second line contains n integers a1,a2,…,an (1≤ai≤100), where ai is the rating of i-th student.
Output
If it is impossible to form a suitable team, print "NO" (without quotes). Otherwise print "YES", and then print k distinct integers from 1 to n which should be the indices of students in the team you form. All the ratings of the students in the team should be distinct. You may print the indices in any order. If there are multiple answers, print any of them.Assume that the students are numbered from 1 to n.
Examples
5 3
15 13 15 15 12
YES
1 2 5
5 4
15 13 15 15 12
NO
4 4
20 10 40 30
YES
1 2 3 4
Note
All possible answers for the first example:
- {1 2 5}
- {2 3 5}
- {2 4 5}
Note that the order does not matter.
解题思路:
AC代码:
1 #include<bits/stdc++.h> 2 using namespace std; 3 int main(){ 4 int n,k,x,m=0,a[105],b[105];bool flag;//a数组存放不重复的元素,b数组记录每个元素的位置 5 cin>>n>>k; 6 for(int i=1;i<=n;++i){ 7 cin>>x;flag=false; 8 for(int j=0;j<m;++j) 9 if(a[j]==x){flag=true;break;} 10 if(!flag){b[m]=i;a[m++]=x;} 11 } 12 if(m>=k){ 13 cout<<"YES"<<endl; 14 for(int i=0;i<k;++i) 15 cout<<b[i]<<(i==k-1?"\n":" "); 16 } 17 else cout<<"NO"<<endl; 18 return 0; 19 }
以上是关于A - Diverse Team的主要内容,如果未能解决你的问题,请参考以下文章
CityPersons《CityPersons:A Diverse Dataset for Pedestrian Detection》
Gemini: Elastic SNARKs for Diverse Environments
算法/论文笔记 Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithm (2017)