代码如下：

#include <iostream>
using namespace std;
const int N = 1010;
int a[N];void init_set() { //初始化for (int i = 1; i <= N; i++)a[i] = i;
}int find_set(int x) { //查找return x == a[x] ? x : find_set(a[x]);
}void union_set(int x, int y) { //合并x = find_set(x);y = find_set(y);if (x != y)a[x] = a[y];
}