摘要：
#include <iostream>#include <cstdio>#include <cstring>int n,m,ans,p[1010];void Make(int *a){for(int i=1;i<=n;i++)p[i] = i;}//每个点都是独立的int Find(int x){return x==p[x]?x:(p[x]=Find(p[x]));//寻找i的父节点void Union(int x,int y){p[Find(x)]=Find(y); }//合并x,yint main(){ while (scanf("%d 阅读全文
