Ice_cream's world I （并查集求环的个数）

ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall between watchtowers be build, in order to partition the ice_cream’s world. But how many ACMers at most can be awarded by the queen is a big problem. One wall-surrounded land must be given to only one ACMer and no walls are crossed, if you can help the queen solve this problem, you will be get a land.

Input

In the case, first two integers N, M (N<=1000, M<=10000) is represent the number of watchtower and the number of wall. The watchtower numbered from 0 to N-1. Next following M lines, every line contain two integers A, B mean between A and B has a wall(A and B are distinct). Terminate by end of file.

Output

Output the maximum number of ACMers who will be awarded. 
One answer one line.

Sample Input

8 10
0 1
1 2
1 3
2 4
3 4
0 5
5 6
6 7
3 6
4 7

Sample Output

3

题意：冰淇淋女王想要给ACMer一些土地，每个ACMER的领土范围必须是用围墙圈起来的，问最多可以给多少个ACMER分土地，换种说法就是求有多少个环。

思路：并查集求环的个数的水题，就不再赘述了。

代码如下：

#include<cstdio>
#include<cstring>
int n,f[1010];
void init()  //初始化
{
    for(int i=0;i<n;i++)
        f[i]=i;
}
int getf(int v) //并查集求祖宗
{
    if(f[v]==v)
        return v;
    return f[v]=getf(f[v]);
}
int main()
{
    int m;
    while(~scanf("%d%d",&n,&m))
    {
        int ans=0;
        init();
        for(int i=0;i<m;i++)
        {
            int a,b;
            scanf("%d%d",&a,&b);
            int t1=getf(a);
            int t2=getf(b);
            if(t1!=t2)  
                f[t2]=t1;
            else   //祖先相同，已经成环了
                ans++;
        }
        printf("%d\n",ans);
    }
}