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

题意：

第一行，n，m，表示n个点（0~7），然后m条边，图中问你形成环的个数。

思路：

利用并查集检测一下就行，在两个点归为一个集合之前，检测是否已经在一个集合，如果已经在一个集合，连通这两点后就会形成环。

代码：

#define N 1010
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int n,m;
int f[N];
int getf(int a)
{
    if(f[a]==a)return a;
    return f[a]=getf(f[a]);
}
bool merge(int a,int b)
{
    a=getf(a);
    b=getf(b);
    if(a!=b)
    {
        f[b]=a;
        return false;
    }
    return true;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0; i<n; i++)
            f[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;
}