PTA甲级考试真题练习107——1107 Social Clusters

题目

思路

典型并查集，集合数组初始化为-1，其中每个根结点的值的相反数代表该节点代表的集合的大小，所以并查集后，对其进行排序后输出<0的数的相反数即可
使用并查集注意：从下标1开始，初始化为-1

代码

#include <iostream>
#include <vector>
#include<algorithm>
using namespace std;
const int nmax = 1005;

vector<int> father;
int n;

bool merge(int i, int j) {
	if (father[i] > father[j]) {
		father[j] += father[i];
		father[i] = j;
	}
	else {
		father[i] += father[j];
		father[j] = i;
	}
	return true;
}

int find(int i) {
	int j = i;
	while (father[j] >= 0)
		j = father[j];
	int t;
	for (int k = i;k!= j; k = t) {
		t = father[k];
		father[k] = j;
	}
	return j;
}

int main()
{
	cin >> n;
	int course[nmax];
	memset(course, 0, sizeof(course));
	father.resize(n+1);
	for (int i = 1; i <= n; ++i) {
		father[i] = -1;
		int num;
		scanf("%d: ", &num);
		for (int j = 0; j < num; ++j) {
			int tmp;
			cin >> tmp;
			//如果还没人喜欢
			if (course[tmp] == 0) 
				course[tmp] = i;
			else {
				int root1 = find(course[tmp]);
				int root2 = find(i);
				merge(root1, root2);
			}
		}
	}
	sort(father.begin()+1, father.end());
	int sum = 0;
	for (int i = 1; i < father.size();++i) {
		if (father[i] > -1)  break;
		else    sum++;
	}
	cout << sum << endl;
	for (int i = 1; i <= sum; ++i) {
		if (i == 1)
			cout << -father[i];
		else
			cout << " " << -father[i];
	}
}