并查集朴素版const int N = 1e5 + 10;int p[N];//返回x的祖宗节点int find(int x){//只有根节点才会有p[x]=xif(p[x] != x) p[x] = find(p[x]);return p[x];}//初始化void init(){//初始每个点都是根节点for (int i = 1; i <= n; i ++ )p[i] = i;}//合