HDU-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

今天是Ignatius的生日。他邀请很多朋友。现在是晚餐时间。 Ignatius想知道至少需要多少张桌子。你必须注意到，并不是所有的朋友都认识对方，所有的朋友都不想留在陌生人身上。
这个问题的一个重要规则是，如果我告诉你A知道B，B知道C，这意味着A，B，C彼此认识，所以他们可以留在一张表中。
例如：如果我告诉你A知道B，B知道C，D知道E，所以A，B，C可以留在一个表中，D，E必须留在另一个表中。所以Ignatius至少需要2个表。
输入
输入以整数T（1 <= T <= 25）开始，表示测试用例数。然后T测试案例。每个测试用例从两个整数N和M开始（1 <= N，M <= 1000）。 N表示朋友的数量，朋友的标记从1到N.然后M行跟随。每行由两个整数A和B（A！= B）组成，这意味着朋友A和朋友B彼此认识。两种情况之间会有空白行。
输出
对于每个测试用例，只需输出至少有几个Ignatius表。不要打印任何空白。
样品输入
2
5 3
1 2
2 3
4 5

5 1
2 5
样品输出
2
4

#include<stdio.h>
const int maxn=1e6+10;
int par[maxn];
void init(int n)//将数组初始化，把每一个独立的都看成是一个集合，需要时合并 
{
	for(int i=0;i<n;i++)
	par[i]=i;
}
int find(int x)//查找并压缩 
{
	if(x!=par[x])
	return par[x]=find(par[x]);
 } 
void unite(int a,int b)//合并 
 {
 	int fa=find(a);
 	int fb=find(b);
 	if(fa!=fb)
 		par[b]=fa;
 }
int main()
{
	int t,m,n,num,a,b;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d",&n);
		num=n-1;
		 for(int i=0;i<=n;i++) 
	 { 
	 	par[i ]=i; 
	 }               
	    scanf("%d",&m); 
		while(m--)  
	    {  
	        scanf("%d %d",&a,&b);  
	        a=find(a);  
	        b=find(b);   
	        if(a!=b)  
	        {  
	               par[b]=a;  
	               num--;  
	        }  
	    }  
	 		printf("%d\n",num+1);  
	}  
     return 0;  
}