nywsp的专栏

#include #include int an[100002],ma[100002]; int find(int x) { int b=x; while(an[x]!=x) x=an[x]; int j; while(b!=x) { j=an[b]; an[b]=x; b=j; } return x; } int lt(int x,int y) { x=f

#include #include int ft[1001],m; int find(int x) { if(ft[x]==0) return x; ft[x]=find(ft[x]); } void merge(int a,int b) { int fa,fb; fa=find(a); fb=find(b); if(fa==fb)

#include #include int ft[1001],m; int find(int x) { if(ft[x]==0) return x; ft[x]=find(ft[x]); } void merge(int a,int b) { int fa,fb; fa=find(a); fb=find(b); if(fa==fb) return; ft[fa]=fb; } int main()