hdu_1213 How Many Tables

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=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 Input

  
  

   
   2
5 3
1 2
2 3
4 5

5 1
2 5
  
  

 

Sample Output

  
  

   
   2
4
  
  

分析：

      题意分析：有一堆人，认识的人坐在一张桌子上（A认识B，B认识C ，我们就说A认识C），问最少需要多少桌子。

      算法分析：利用并查集，求出集合的个数就可以了。

我的代码：

#include<stdio.h>
#define MAXN 1005
int f[MAXN];
int r[MAXN];
int find(int n)
{
    if(n==f[n]) return n;
    else return f[n]=find(f[n]);
}
void Union(int x,int y)
{
    int a=find(x);
    int b=find(y);
    if(a==b) return ;
    else
    {
        if(r[a]<r[b])  //按秩合并，即将元素少的并进元素多的集合中。
        {
            f[a]=b;
            r[b]+=r[a];
        }
        else
        {
            f[b]=a;
            r[a]+=r[b];
        }

    }
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            f[i]=i;
            r[i]=1;
        }
        for(int i=0;i<m;i++)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            Union(a,b);
        }
        int ans=0;
        for(int i=1;i<=n;i++)  //看有几个集合。
        {
            if(i==f[i]) ans++;
        }
        printf("%d\n",ans);
    }


    return 0;
}

总结：基础的并查集应用。求集合个数。