并查集模板

int f[10005];void init(){int i;for(i = 0;i<10005;i++)f[i] = i;}int find(int x)//寻找x的根{if(f[x] != x)f[x] = find(f[x]);return f[x];}void join(int x,int y)//讲y放入x的集合中{int p = find(x);int q = find(y);if(q != p)f[p] = q;}