笨-Archangel

摘要： #include<iostream>#include<cstdio>using namespace std;int city[1005];int sum;int find(int x){ int r=x; while(city[r]!=r) { r=city[r]; } return r;}void mege(int x,int y){ int fx,fy; fx=find(x); fy=find(y); if(fx!=fy) { if(fx>fy) city[fx]=fy; ... 阅读全文