HDU 2120 Ice_cream's world I （并查集判环）

Description：

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条边，被围起来的地可以分给一个人，求最多可以把地分给几个人，并查集判环，只要是父节点相同的两个节点就可以成环，这样就是可以分给一个人。

这道题需要多组输入。

AC代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdlib.h>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<math.h>
using namespace std;
typedef long long ll;
typedef double ld;
const int INF=0x3f3f3f3f;
using namespace std;
int i,j,k;
int n,m,t;
int x,y;
int ans,res,cnt,temp;
int pre[1010];
int Find(int x)
{
    int r=x;
    while(pre[r]!=r)
    {
        r=pre[r];
    }
    return r;
}

int join(int x,int y)
{
    int fx=Find(x);
    int fy=Find(y);
    if(fx==fy)
        return 1;
    if(fx!=fy)
    {
        pre[fy]=fx;
        return 0;
    }
}

int main()
{
    while(cin>>n>>m)
    {
        for(i=0; i<n; i++)
            pre[i]=i;
        ans=0;
        while(m--)
        {
            cin>>x>>y;
            ans+=join(x,y);
            //cout<<ans<<endl;
        }
        cout<<ans<<endl;
    }
    return 0;
}