hdu1856

//别人的代码

//他应用了离散化

#include <iostream>
#include <algorithm>
#include <map>
using namespace std;

int n, ans;
const int size = 100010;
struct data
{
    int x, y;
}node[size];
int arr[size*2];
int father[size];
int Rank[size];
map<int, int>mp;

void init()
{
    mp.clear();
    for (int i = 0; i <=n; i++)
    {
        father[i] = i;
        Rank[i] = 1;
    }
}

int find(int x)
{
    return x == father[x] ? x : father[x] = find(father[x]);
}

void Union(int x, int y)
{
    if (Rank[x] >= Rank[y])
    {
        Rank[x] += Rank[y];
        father[y] = x;
        if (Rank[x] > ans)
            ans = Rank[x];
    }
    else
    {
        Rank[y] += Rank[x];
        father[x] = y;
        if (Rank[y] > ans)
            ans = Rank[y];
    }
}

int main()
{
    cin.sync_with_stdio(false);
    int x, y, num, cnt;
    while (cin >> n)
    {
        init();
        cnt = 0;
        ans = 1;
        for (int i = 0; i<n; i++)
        {
            cin >> x >> y;
            node[i].x = x;
            node[i].y = y;
            arr[cnt++] = x;
            arr[cnt++] = y;
        }
        sort(arr, arr + cnt);
        cnt = unique(arr, arr + cnt) - arr;
        for (int i = 0; i<cnt; i++)
        {
            mp[ arr[i] ] = i;
        }
        for (int i = 0; i<n; i++)
        {
            x = mp[ node[i].x ];
            y = mp[ node[i].y ];
            x = find(x); 
            y = find(y);
            if (x != y)
            {
                Union(x, y);
            }
        }
        cout << ans << endl;
    }
    return 0;
}

//我的代码，还是一个并查集

#include<iostream>
#include<string.h>
using namespace std;
int pre[1000005],visit[1000005];
void init()
{
    int i;
    for(i=1;i<=200000;i++)
    {
        pre[i]=i;
    }
}
int find(int x)
{
    if(pre[x]==x)
        return x;
    else
        return pre[x]=find(pre[x]);
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
            cout<<1<<endl;
        else
        {
            int i;
            int a,b,x,y,max2=-1;
            init();
            memset(visit,0,sizeof(visit));
            for(i=1;i<=n;i++)
            {
                scanf("%d%d",&a,&b);
                
                if(a>max2)
                    max2=a;
                if(b>max2)
                    max2=b;
                x=find(a);
                y=find(b);
                {
                    pre[x]=y;
                    visit[a]=visit[b]=1;
                    
                }
                
            }
            for(i=1;i<=max2;i++)
            {
                if(visit[i]>=1)
                {
                    x=find(i);
                    //cout<<i<<" "<<x<<endl;
                    visit[x]++;
                }
            }
            int max1=-1;
            for(i=1;i<=max2;i++)
            {
                if(max1<visit[x])
                    max1=visit[x];
            }
            cout<<max1-1<<endl;
        }
    }
}