hdu 1213 并查集

Problem Description:
 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 Input2
5 3
1 2
2 3
4 5

5 1
2 5 
Sample Output
2
4
题目大意：第一行输入t，表示有t行测试实例，在输入n和m，表示有n个朋友，后面m行输入。
 Ignatiu的朋友有一个原则： 他们是不会和陌生人在一个桌子上的。即朋友的朋友是朋友，那么可以坐一个桌子上，问至少要有多少个桌子？

解题思路：并查集判断图连通，或者找出图有多少个连通分量

代码：

#include <iostream>
using namespace std;
int a[1010];
int n,m,t; 
void merge()//初始化数组
{
    int i;
    for(i=0;i<=n;i++)
    {
        a[i]=i;
    }
}
int get(int x)//寻找父节点
{
    if(x!=a[x])
    {
        a[x]=get(a[x]); //路径压缩
    }
    return a[x];
}
int main()
{
    cin>>t;
    while(t--)
    {
        int z,b,aa,bb,sum=0;
        cin>>n>>m;
        merge();
        while(m--)
        {
            cin>>z>>b;
            aa=get(z);
            bb=get(b);
            if(aa!=bb)
            {
                a[aa]=bb;
            }
        }
        for(int i=1;i<=n;i++)
        {
            if(a[i]==i)sum++;
        }
        cout<<sum<<endl;
    }
 return 0;
}