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，让你计算出来。

 

思路：

用并查集的的方法如果两个瞭望塔的根节点相同，说明有环。

 

代码：

#define N 1010
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,m;
int flag[N];
int getf(int a)
{
    if(flag[a]==a)
        return a;
    else
        return flag[a]=getf(flag[a]);
}
int merge(int a,int b)
{
    int t1=getf(a);
    int t2=getf(b);
    if(t1!=t2)
    {
        flag[t2]=t1;
        return 0;
    }
    return 1;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0; i<n; i++)
            flag[i]=i;
        int a,b,sum=0;
        for(int i=0; i<m; i++)
        {
            scanf("%d%d",&a,&b);
            if(merge(a,b)==1)
                sum++;
        }
        printf("%d\n",sum);
    }
    return 0;
}