A - Ice_cream's world I HDU - 2120

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分地，女王的土地中有很多瞭望塔，女王命令下人在瞭望塔（watchtower） 与瞭望塔之间建立笔直的围墙，被围墙圈起来的土地可以用来奖励ACMER，但是女王不知道最多能奖励多少ACMER，请你来帮忙。

解题思路：并查集问题，判断是否有环，通过并查集如果两个瞭望台的根节点相同就形成环。最后看有多少环即可

代码如下：

#include<stdio.h>
#include<algorithm>
using namespace std;
#define maxn 1010
int f[maxn];
void init()
{
    for(int i=0; i<maxn; i++)
        f[i]=i;
}
int getf(int x)
{
     if(x==f[x]) return x;
     else return getf(f[x]);
}
int merge(int u, int v)
{
    int t1 = getf(u);
    int t2 = getf(v);
    if(t1 == t2) return 1; //根节点相同， 说明成环
    f[t2] = t1;
    return 0;
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        init();
        int a,b;
        int sum= 0;
        for(int i=0; i<m; i++)
        {
            scanf("%d%d",&a,&b);
            sum+=merge(a,b);
        }
        printf("%d\n",sum);
    }
    return 0;
}