关键模板:
// 通过这几个函数实现ID分块
int father[100],exist[100];
for(int i = 0; i < 110; i++)
father[i] = i;
int findFather(int x){
int a = x;
while(x != fa[x])
x = fa[x];
while(a != fa[a]) {
int z = a;
a = fa[a];
fa[z] = x;
}
return x;
}
void Union(int a, int b){
int fa = findFather(a);
int fb = findFather(b);
if(fa != fb)
father[fa] = fb;
}
//统计每块信息,例如人数。有哪些块
for(int i = 0; i < 110; i++){
if(exist[i]){
/*自定义*/
}
}