题目:【模板】左偏树(可并堆)
注意:不能忘了考虑-1的情况,不然会MLE。
代码:
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <cstring>
#include <map>
using namespace std;
#define maxn 100000
int n,m;
int a[maxn+5]= {0};
int fa[maxn+5]= {0},lch[maxn+5]= {0},rch[maxn+5]= {0};
int d[maxn+5]= {0};
int find(int x) {
if(fa[x]==-1) return -1;
if(x==fa[x]) return x;
return find(fa[x]);
}
int merge(int x,int y) {
if(!x) return y;
if(!y) return x;
if(a[x]>a[y]) swap(x,y);
rch[x]=merge(rch[x],y);
if(d[lch[x]]<d[rch[x]]) swap(lch[x],rch[x]);
d[x]=rch[x]+1;
fa[lch[x]]=x;
fa[rch[x]]=x;
return x;
}
int main() {
scanf("%d%d",&n,&m);
for(int i=1; i<=n; i++) {
scanf("%d",&a[i]);
fa[i]=i;
}
for(int i=1; i<=m; i++) {
int opr,x,y;
scanf("%d%d",&opr,&x);
if(opr==1) {
scanf("%d",&y);
x=find(x),y=find(y);
if(x==y||x==-1||y==-1);
else merge(find(x),find(y));
}
if(opr==2) {
x=find(x);
if(x==-1) printf("-1\n");
else {
printf("%d\n",a[x]);
fa[x]=-1;
fa[lch[x]]=lch[x],fa[rch[x]]=rch[x];
merge(lch[x],rch[x]);
}
}
}
return 0;
}