摘要：
#include<iostream>using namespace std;int father[50005];int rank[50005];int maxNum;void make_set(int x){ father[x]=x; rank[x]=1;}int find_set(int x){ if(x!=father[x]) { father[x]=find_set(father[x]); } return father[x];}void Union(int x,int y){ x=find_set(x); y=... 阅读全文