左偏树 zoj 2334

poj 的1056实在是没看出来怎么用左偏树做啊。。

这道题我自己编的代码 一直都是SF，SF，SF。。只好拷别人的代码了。。

http://jidayangfei.blog.163.com/blog/static/1349366082010107114825861/

书里说的不是很懂，看这个网站原理明白了一些
真是博大精深啊


最近做了不少练习赛，被血虐，唉。。。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define MAXN 100000+100
struct node
{
    int num,NPL;
    int left,right;
};
node tree[MAXN];
int n,m;
int f[MAXN],root[MAXN];
int find(int x)
{
    return f[x]==-1? x:f[x]=find(f[x]);
}
int Union(int x,int y)
{
    f[find(x)]=find(y);
}
int merge(int x,int y)
{
    if(x==0) return y;
    if(y==0) return x;
    if(tree[y].num>tree[x].num)
        swap(x,y);
    tree[x].right=merge(tree[x].right,y);

    if(tree[tree[x].left].NPL<tree[tree[x].right].NPL)
        swap(tree[x].left,tree[x].right);

    if(tree[x].right==0) tree[x].NPL=0;
    else
        tree[x].NPL=tree[tree[x].right].NPL+1;
    return x;
}

int solve(int x,int y)
{
    if(find(x)==find(y)) return -1;
    int root_x=root[find(x)],root_y=root[find(y)];
    tree[root_x].num/=2; tree[root_y].num/=2;

    int tmp_x=merge(tree[root_x].left,tree[root_x].right);   //合并左子树和右子树即可删除根节点
    tree[root_x].left=tree[root_x].right=tree[root_x].NPL=0;
    tmp_x=merge(tmp_x,root_x);

    int tmp_y=merge(tree[root_y].left,tree[root_y].right);
    tree[root_y].left=tree[root_y].right=tree[root_y].NPL=0;
    tmp_y=merge(tmp_y,root_y);

    Union(x,y);
    root[find(x)]=merge(tmp_x,tmp_y);
    //cout<<tree[tmp_x].num<<" "<<tree[tmp_y].num<<" "<<y<<endl;
    return tree[root[find(x)]].num;
}

int main()
{
    int i,x,y;
    while(scanf("%d",&n)!=EOF)
    {
        memset(tree,0,sizeof(tree));
        memset(f,0xff,sizeof(f));
        for(i=1;i<=n;i++) root[i]=i;
        for(i=1;i<=n;i++)
            scanf("%d",&tree[i].num);
        scanf("%d",&m);
        while(m--)
        {
            scanf("%d%d",&x,&y);
            printf("%d\n",solve(x,y));
        }
    }
    return 0;
}

下面是我自己的，错了，SF。。求指点

# include <stdio.h>
# include <string.h>
# include <iostream>
using namespace std;
const int maxn=1000000;
int tot,v[maxn],l[maxn],r[maxn],d[maxn],f[maxn];
int find(int x)
{
    return f[x]==x?x:f[x]=find(f[x]);
}

int merge(int x,int y)
{
    if(!x) return y;
    if(!y) return x;
    if(v[x]<v[y]) swap(x,y);
    r[x]=merge(r[x],y);
    if(d[l[x]]<d[r[x]]) swap(l[x],r[x]);
    if(!r[x]) d[x]=0;
    else d[x]=d[r[x]]+1;
    return x;
}
int solve(int a,int b)
{
    int fa=find(a);
    int fb=find(b);
    if(fa==fb) return -1;
    v[fa]/=2;
    int ma=merge(l[fa],r[fa]);
    l[ma]=r[ma]=d[ma]=0;
    int mma=merge(ma,fa);

    v[fb]/=2;
    int mb=merge(l[fb],r[fb]);
    l[mb]=r[mb]=d[mb]=0;
    int mmb=merge(mb,fb);

    int p=merge(mma,mmb);
    f[a]=f[b]=f[fa]=f[fb]=f[mma]=f[mmb]=p;

    return v[p];
}

int main ()
{
    int n,i,m;
    int a,b;
    while(scanf("%d",&n)!=EOF)
    {
        memset(l,0,sizeof(l));
        memset(r,0,sizeof(r));
        memset(d,0,sizeof(d));
        memset(v,0,sizeof(v));
        for(i=1; i<=n; i++) f[i]=i;
        tot=0;
        for(i=1; i<=n; i++)
        {
            scanf("%d",&v[i]);
        }
        scanf("%d",&m);
        for(i=0; i<m; i++)
        {
            scanf("%d%d",&a,&b);
            printf("%d\n",solve(a,b));
        }
    }
}