HDU 1512 (左偏树 并查集)

题意:有n只猴子,每只猴子都有一个能力值.最初每只猴子都只认识自己.然后

给出m组询问,每次都有两只猴子,如果他们相互认识输出-1,否则他们会请出他们认

识的猴子中能力值最大的猴子,这两只猴子自身的能力值除以2,然后两队猴子都

相互认识了.每次输出这堆相互认识的猴子中能力值最高的.

显然需要一个并查集维护下认识的猴子,然后需要另一种数据结构能够实现:

某一堆中的最大值查找;合并两个堆.

显然就是左偏树了.每次找到两个并集根,先把两个根的能力值除以二存下来,

然后两个左偏树删掉堆顶,然后把新的能力值插进去再合并就行了.最后更新下

并查集和输出新堆顶.

#include <cstring>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
#define maxn 111111

int n, m;
int a[maxn];
int fa[maxn];
int Find (int x) {return fa[x] == x ? fa[x] : fa[x] = Find (fa[x]);}

struct node {//左偏树节点
    int key, dis;
    node *l, *r;
    bool operator < (const node &b) const {
        return key > b.key;
    }
};
node *tree[maxn];

void init (node *&t, int key) {
    t = new node;
    t->l = t->r = NULL;
    t->key = key;
    t->dis = 0;
}

int dis (node *a) {//计算左偏树的dis值
    if (a == NULL)
        return -1;
    return a->dis;
}

node *merge (node *a, node *b) {//合并两棵左偏树
    if (a == NULL) return b;
    if (b == NULL) return a;
    if (*b < *a) swap (a, b);
    a->r = merge (a->r, b);
    if (dis (a->r) > dis (a->l)) swap (a->l, a->r);
    a->dis = dis (a->r) + 1;
    return a;
}

node *pop (node *a) {//删除左偏树key值最小的节点
    if (!a) return NULL;
    return merge (a->l, a->r);
}

node *insert (node *root, int num) {//左偏树中插入key值为num的节点
    node *p;
    init (p, num);
    return merge (root, p);
}

int top (node *a) {//去取左偏树key值最大的元素
    return a->key;
}

int main () {
    //freopen ("in.txt", "r", stdin);
    //freopen ("out1.txt", "w", stdout);
    while (scanf ("%d", &n) == 1) {
        for (int i = 1; i <= n; i++) {
            scanf ("%d", &a[i]);
            fa[i] = i;
            init (tree[i], a[i]);
        }
        scanf ("%d", &m);
        while (m--) {
            int u, v;
            scanf ("%d%d", &u, &v);
            int p1 = Find (u), p2 = Find (v);
            if (p1 == p2) {
                printf ("-1\n");
            }
            else {
                node *root1 = tree[p1];
                node *root2 = tree[p2];
                fa[p2] = p1;
                int num1 = top (root1), num2 = top (root2);
                root1 = pop (root1), root2 = pop (root2);
                num1/=2, num2/=2;
                root1 = merge (root1, root2);
                root1 = insert (root1, num1);
                root1 = insert (root1, num2);
                tree[p1] = root1;
                printf ("%d\n", top (root1));
            }
        }
        for (int i = 1; i <= n; i++) if (tree[i]) {
            delete tree[i];
        }
    }
    return 0;
}