How Many Tables(解题报告)

                                                                                                           How Many Tables

                                                            Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u

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 Input

     
     

      
      2
5 3
1 2
2 3
4 5

5 1
2 5
     
     

 

Sample Output

     
     

      
      2
4




思想：本题大意是某人过生日请朋友，让直接认识或者间接认识的朋友坐一桌，问至少需要多少桌。运用并查集的知识，先对数组进行初始化，例如p[i]=i（注意
     初始化时要取到n这个临界值，即i<=n）,然后在循环里每次输入两个数，第一次输入时，建立两个数的关系，即其中一个认另一个做老大；接下来的循环输
     入时通过“查”函数找到该数的老大，若二者老大不一样，就让其中一个老大认另一个老大做老大，以此来推（注意此时循环判定条件为i<b）。最后用循环遍
     历，找出p[i]!=i的个数，用count计数，即得到结果。




解题代码：
#include <stdio.h>
int p[100000];
void init(int n)
{
    int i;
    for(i=0;i<=n;i++)
    {
        p[i]=i;
    }
}

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

void unin( int x , int y )
{
    int xp = find(x);
    int yp = find(y);
    if( xp != yp )
        p[xp] = yp;
}
int main()
{
    int n,a,b,k1,k2,x,y,i,count;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d%d",&a,&b);
        init(a);
        for(i=0;i<b;i++)
        {
            scanf("%d%d",&k1,&k2);
            unin(k1,k2);
        }
        count=0;
        for(i=1;i<=a;i++)
        {
            if(p[i]==i)
                count++;
        }
        printf("%d\n",count);
    }
    return 0;
}