HDU 5575

HDU 5575

左偏树

洛谷左偏树裸题：https://www.luogu.org/problem/P3377

洛谷讲解：https://www.cnblogs.com/pks-t/p/10326682.html

洛谷AC代码：

#include <bits/stdc++.h>
const int N=100010;
#define ls S[x].Son[0]
#define rs S[x].Son[1]

using namespace std ;
struct Tree
{
    int dis, val, Son[2], rt ;
} S[N] ;
int n,m,op,x,y;

inline int Get(int x)
{
    return S[x].rt == x ? x : S[x].rt = Get(S[x].rt) ;
}
inline int Merge(int x, int y)
{
    if (!x || !y) return x + y ;
    if (S[x].val > S[y].val || (S[x].val == S[y].val && x > y))
        swap(x, y) ;
    rs = Merge(rs, y) ;
    if (S[ls].dis < S[rs].dis) swap(ls, rs) ;
    S[ls].rt = S[rs].rt = S[x].rt = x, S[x].dis = S[rs].dis + 1 ;
    return x ;
}
inline void Pop(int x)
{
    S[x].val = -1, S[ls].rt = ls, S[rs].rt = rs, S[x].rt = Merge(ls, rs) ;
}

int main()
{
    scanf("%d%d",&n,&m);
    S[0].dis = -1 ;
    for (int i = 1 ; i <= n ; ++ i)
        S[i].rt = i, scanf("%d", &S[i].val) ;
    while(m--)
    {
        scanf("%d%d", &op, &x) ;
        if (op==1)
        {
            scanf("%d", &y) ;
            if (S[x].val == -1 || S[y].val == -1) 
                continue ;
            int f1 = Get(x), f2 = Get(y) ;
            if (f1 != f2) 
                S[f1].rt = S[f2].rt = Merge(f1, f2) ;
        }
        else
        {
            if(S[x].val == -1)
                printf("-1\n") ;
            else 
                {printf("%d\n", S[Get(x)].val);Pop(Get(x));}
        }
    }
    return 0 ;
}

杭电这题的讲解：https://www.cnblogs.com/zyb993963526/p/7849543.html