数据结构之并查集

觉得很不错的参考资料引用一下：
https://segmentfault.com/a/1190000004023326
http://blog.csdn.net/acdreamers/article/details/7671556
数组实现：合并操作代价高，可达O(n^2).

链表实现：

树结构实现：查找与合并的平均时间复杂度为O(log_2⁡n)，与树的深度有关，

优化：降低时间复杂度
按秩合并：若h_b＞h_b，则将B树作为A树的子树。
带路径压缩的查找算法：改变结点所指方向以减小深度，查找路径时“走两遍”，第一遍找到根结点，第二遍让路径上的点指向根结点。

Solved :
hdu1856 More is Better

            hdu1272 小希的迷宫

#include <stdio.h>

#define max(a,b) ((a)>(b)?(a):(b))
#define MAX 100010

int p[MAX],num[MAX],visit[MAX];
int large = 0,mark,Enum;

int findx(int x)
{
    if(p[x]!=x)
        p[x]=findx(p[x]);
    return p[x];
}
void Union(int x,int y)
{
    int fx,fy;
    if(large < max(x,y)){
        large = max(x,y);
       // printf("large = %d\n",large);
    }
    fx = findx(x);
    fy = findx(y);
    if(fx != fy){
        p[fx]=fy;
       // printf("x,y:(%d,%d)\n",x,y);
        num[fy] += num[fx];
        Enum++;
       // printf("num[%d] = %d\n",fy,num[fy]);
    }
    else mark = 0;
}


int main()
{
    int i,x,y,Vernum;
    while(scanf("%d%d",&x,&y) && x!=-1 && y!=-1)
    {

         if( x==0 && y==0 ){
               printf("Yes\n");
               continue;
           }
        mark = 1;
        large = 0;
        Vernum = 0;
        Enum = 0;
        for(i = 1; i<=MAX; i++){
            p[i] = i;
            num[i] = 1;
            visit[i] = 0;
        }
        visit[x] = 1;
        visit[y] = 1;
        Union(x,y);
       while(scanf("%d%d",&x,&y) && x!=0 && y!=0){
            Union(x,y);
            visit[x] = 1;
            visit[y] = 1;
        }

        for(i = 1; i<=large; i++)
            if(visit[i]==1)
                Vernum++;
        if(mark==1 && Vernum-1 == Enum)
            printf("Yes\n");
        else
            printf("No\n");

    }
}

hdu1213 How Many Tables

#include <stdio.h>

#define max(a,b) ((a)>(b)?(a):(b))
#define MAX 100010

int p[MAX];
int mark;

int findx(int x)
{
    if(p[x]!=x)
        p[x]=findx(p[x]);
    return p[x];
}
void Union(int x,int y)
{
    int fx,fy;
    fx = findx(x);
    fy = findx(y);
    if(fx != fy){
        p[fx]=fy;
       // printf("x,y:(%d,%d)\n",x,y);
    }
}


int main()
{
    int T,i,n,m,x,y;
    while( scanf("%d",&T)!=EOF)
    {
        while(T--){
            scanf("%d%d",&n,&m);
             for(i = 1; i<=MAX; i++){
                p[i] = i;
            }
            mark = 0;
            while(m--){
                scanf("%d%d",&x,&y);
                Union(x,y);
            }
            for(int i=1;i<=n;i++)
                if(p[i]==i)
                    mark++;
            printf("%d\n",mark);
        }//while T
    }
}