hdu 1213 How Many Tables（并查集水题）

题目：
Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.

One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.

For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
Input
The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.
Output
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
Sample Input
2
5 3
1 2
2 3
4 5

5 1
2 5
Sample Output
2
4

AC代码：

#include<cstdio>using namespace std;#define MAX 1005int father[MAX]; //父亲 //这三个函数可以直接当做模板void initialize(int n){    //初始化n个元素     for(int i = 1; i <= n; i++)         father[i] = i;     //刚开始自己就是自己的父亲}int find(int i){     //寻找树的根    if(father[i] == i)        return father[i];     else return father[i] = find(father[i]);}void unite(int x, int y){   //合并x和y所属的集合     x = find(x);    y = find(y);    if(x == y) return ;    else        father[x] = y;}int main(){    int t;    scanf("%d", &t);    while(t--){        int m, n;        int count = 0;        scanf("%d %d", &n, &m);        initialize(n);        int a, b;        for(int i = 1; i <= m; i++){            scanf("%d %d", &a, &b);            unite(a, b);        }        for(int j = 1; j <= n; j++)            if(father[j] == j)                count++;        printf("%d\n", count);    }       return 0;}