模板：并查集

Posted 2020-10-10

1 //递归版路径压缩
2 int find(int x){return x==Father[x]?x:Father[x]=find(Father[x]);}
3 
4 void Union(int x,int y){
5     int fx=find(x),fy=find(y);
6     if(fx!=fy) Father[fx]=fy;
7 }//合并