HDU - 1512 Monkey King

题意：

有 n 只猴子，各自有一个强壮值，它们一开始互不认识。之后有 m 次冲突，每次有两只猴子起冲突，它们各自会找朋友中最强壮的来出面打架，打架的两只猴子强壮值减半，并且成为朋友。每次冲突后输出两只猴子的朋友中的最大强壮值，若冲突发生在朋友间，输出 -1。(n, m <= 1e5)

链接：

https://vjudge.net/problem/HDU-1512

解题思路：

维护可合并的大根堆，左偏树。

参考代码：

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define sz(a) ((int)a.size())
#define mem(a, b) memset(a, b, sizeof a)
#define lson (rt << 1)
#define rson (rt << 1 | 1)
#define gmid (l + r >> 1)
const int maxn = 1e5 + 5;
const int maxm = 1e3 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;

struct Node{
	int ls, rs, fa, val, dis;
} tr[maxn];
int n, m;

int merge(int x, int y){

	if(!x || !y) return x + y;
	if(tr[x].val < tr[y].val) swap(x, y);
	tr[x].rs = merge(tr[x].rs, y);
	if(tr[tr[x].ls].dis < tr[tr[x].rs].dis) swap(tr[x].ls, tr[x].rs);
	tr[x].dis = tr[tr[x].rs].dis + 1, tr[tr[x].ls].fa = tr[tr[x].rs].fa = x;
	return x;
}

int fin(int x){

	return x == tr[x].fa ? x : tr[x].fa = fin(tr[x].fa);
}

int pop(int x){

	tr[tr[x].ls].fa = tr[x].ls, tr[tr[x].rs].fa = tr[x].rs;
	tr[x].fa = merge(tr[x].ls, tr[x].rs); // 原根回指新根, 虚点
	tr[x].val >>= 1, tr[x].ls = tr[x].rs = tr[x].dis = 0;
	return tr[x].fa;
}

int main(){

    ios::sync_with_stdio(0); cin.tie(0);
	while(cin >> n){

		for(int i = 1; i <= n; ++i){

			cin >> tr[i].val;
			tr[i].ls = tr[i].rs = tr[i].dis = 0, tr[i].fa = i;
		}
		cin >> m;
		while(m--){

			int x, y; cin >> x >> y;
			x = fin(x), y = fin(y);
			if(x == y) {cout << "-1" << endl; continue;}
			int fx = pop(x), fy = pop(y);
			tr[x].fa = tr[fx].fa = merge(x, fx);
			tr[y].fa = tr[fy].fa = merge(y, fy);
			tr[x].fa = tr[y].fa = merge(tr[x].fa, tr[y].fa);
			cout << tr[fin(x)].val << endl;
		}
	}
    return 0;
}