BZOJ1455 罗马游戏

支持合并，删除最小值操作的不就是可并堆吗。。。

还要窝有板子，液！

这题还要注意，对于一个点，找根的话，要用到并查集。

/**************************************************************
    Problem: 1455
    User: rausen
    Language: C++
    Result: Accepted
    Time:1316 ms
    Memory:21312 kb
****************************************************************/
 
#include <cstdio>
#include <algorithm>
 
using namespace std;
const int N = 1000001;
int n, m, fa[N];
bool died[N];
 
struct heap{
    int v, l, r, dep;
}h[N];
 
int Cnt;
 
inline int read(){
    int x = 0;
    char ch = getchar();
    while (ch < '0' || ch > '9')
        ch = getchar();
    while (ch >= '0' && ch <= '9'){
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x;
}
 
int pr[10], NUM = 0;
inline void print(int x){
    while (x)
        pr[++NUM] = x % 10, x /= 10;
    while (NUM)
        putchar(pr[NUM--] + '0');
    putchar('
');
}
 
int find_fa(int x){
    return fa[x] == x ? x : fa[x] = find_fa(fa[x]);
}
 
inline int new_heap(int x){
    h[++Cnt].v = x;
    h[Cnt].l = h[Cnt].r = h[Cnt].dep = 0;
    return Cnt;
}
 
int Merge(int x, int y){
    if (!x || !y) return x + y;
    if (h[x].v > h[y].v)
        swap(x, y);
    h[x].r = Merge(h[x].r, y);
    if (h[h[x].l].dep < h[h[x].r].dep)
        swap(h[x].l, h[x].r);
    h[x].dep = h[h[x].r].dep + 1;
    return x;
}
 
int Top(int x){
    return h[x].v;
}
 
int Pop(int x){
    return Merge(h[x].l, h[x].r);
}
 
int main(){
    n = read();
    int i, t, x, y;
    for (i = 1; i <= n; ++i)
        new_heap(read()), fa[i] = i;
    h[0].dep = -1;
    char ch;
    m = read();
    for (i = 1; i <= m; ++i){
        ch = getchar();
        while (ch != 'M' && ch != 'K') ch = getchar();
        if (ch == 'M'){
            x = read(), y = read();
            if (died[x] || died[y]) continue;
            x = find_fa(x), y = find_fa(y);
            if (x != y)
                t = Merge(x, y), fa[x] = fa[y] = t;
        }else{
            x = read();
            if (died[x]){
                puts("0");
                continue;
            }
            x = find_fa(x);
            died[x] = 1;
            print(h[x].v);
            fa[x] = Merge(h[x].l, h[x].r);
            fa[fa[x]] = fa[x];
        }
    }
    return 0;
}