hdu1232 并查集

虽然是很水很水很水很水的题，但是我的目标就是把A过的题都贴在博客上，所以如果有大神看见了小人的博客，还忘轻喷。

#include <cstdio>
#include <iostream>

using namespace std;

const int MAX_N = 1005;
int par[MAX_N];  //从1开始计算
int height[MAX_N];
int visited[MAX_N];
int N,M;


void init(int n){
    for(int i=1; i<=n; i++){
        par[i] = i;
        height[i] = 0;
        visited[i] = 0;
    }
}

int find(int x){
    if(x == par[x]){
        return x;
    }else{
        return par[x] = find(par[x]);
    }
}

void  unite(int x, int y){
    x = find(x);
    y = find(y);
    if(x == y)return;

    if(height[x]<height[y]){
        par[x] = y;
    }else{
        par[y] = x;
        if(height[x] == height[y])height[x]+=1;
    }
}

int main(){
    int fir,sec;
    int ans;
    while(true){
        scanf("%d",&N);
        if(N==0)break;
        scanf("%d",&M);
        ans = 0;
        init(N);
        for(int i=1; i<=M; i++){
            scanf("%d%d", &fir, &sec);
            unite(fir,sec);
        }
        int temp;
        for(int i=1;i<=N; i++){
            temp = find(i);
            if(visited[temp] == 0){
                ans++;
                visited[temp] = 1;
            }
        }
        cout << ans-1<<endl;
    }
}