数据结构 并查集 HDU 1213

#include <iostream>#include <stdio.h>using namespace std;int sum, n, m;int bin[1000];int findx(int x){if(x!=bin[x])bin[x]=findx(bin[x]);return bin[x];}void Union(int a, int b){int x,y;x=findx(a);y=findx(b);if(x==y)return;sum=sum-1;bin[y]=x;}int main(){int t;cin>>t;for(int j=1; j<=t; j++){cin>>n>>m;sum=n;for(int i=1; i<=n; i++)bin[i]=i;int first, second;for(int i=1; i<=m; i++){cin>>first>>second;Union(first, second);}cout<<sum<<endl;getchar();}return 0;}