这道题容易写成将爱好分类
参考了柳神的代码,解决了上述的错误。
基本思路:
首先,将 init(), findfather(),Union()函数写出来
借用一个hobby数组作为“跳板”,联系具有相同爱好的人
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn = 1010;
int father[maxn+maxn];
int isroot[maxn]; //存放以每个根节点(==下标)的节点数
void init(int maxn) {
for (int i = 1; i <= maxn; i++) {
father[i] = i;
isroot[i] = 0;
}
}
int findfather(int x) {
int a = x;
while (x != father[x]) x = father[x]; //寻找父亲结点
/*压缩路径*/
while (a!=father[a]){
int z = a;
a = father[a];
father[z] = x;
}
return x;
}
void Union(int a, int b) { //b为新的父节点
int faA = findfather(a);
int faB = findfather(b);
if (faA != faB) father[faA] = faB;
}
bool cmp(int a, int b) {
return a > b;
}
int main() {
int n, k,temp, hobby[maxn]; //hobby:有这个爱好的人(记录最先喜欢的即为根节点)
memset(hobby, 0, sizeof(hobby));
scanf("%d", &n);
init(n); //初始化
for (int i = 1; i <= n; i++) {
scanf("%d: ", &k);
for (int j = 1; j <= k; j++) {
scanf("%d", &temp);
if (hobby[temp] == 0) hobby[temp] = i; //如果暂时没人有这个爱好,记录自己
Union(i, findfather(hobby[temp]));//i和有这个爱好的人Union
}
}
for (int i = 1; i <= n; i++)
isroot[findfather(i)]++;
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (isroot[i] != 0) cnt++;
}
printf("%d\n", cnt);
sort(isroot, isroot+n+1, cmp);
for (int i = 0; i < cnt; i++) {
printf("%d", isroot[i]);
if (i != cnt - 1) printf(" ");
}
return 0;
}