题目:
题解:
可并堆的裸题,这次的操作是合并,删除,插入,插入的话就是把一个点merge到一个堆里,别的都是基本操作了
代码:
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N=100005;
int f[N],a[N],rs[N],ls[N],dis[N];
int find(int x){if (f[x]!=x) f[x]=find(f[x]);return f[x];}
int merge(int x,int y)
{
if (!x || !y) return x+y;
if (a[x]<a[y]) swap(x,y);
rs[x]=merge(rs[x],y);
if (dis[rs[x]]>dis[ls[x]]) swap(ls[x],rs[x]);
dis[x]=dis[rs[x]]+1;
return x;
}
int pop(int x)
{
f[x]=merge(ls[x],rs[x]);
f[f[x]]=f[x];
ls[x]=rs[x]=dis[x]=0;
return f[x];
}
int main()
{
int n,m;
while (scanf("%d",&n)!=EOF)
{
memset(rs,0,sizeof(rs));memset(ls,0,sizeof(ls));
memset(dis,0,sizeof(dis));
for (int i=1;i<=n;i++) scanf("%d",&a[i]),f[i]=i;
scanf("%d",&m);
while (m--)
{
int x,y;scanf("%d%d",&x,&y);
x=find(x); y=find(y); int top;
if (x==y) {printf("-1\n");continue;}
a[x]/=2; int fx=pop(x); top=merge(x,fx); f[fx]=f[x]=top;
a[y]/=2; int fy=pop(y); top=merge(y,fy); f[fy]=f[y]=top;
x=find(x); y=find(y); top=merge(x,y); f[x]=f[y]=top;
printf("%d\n",a[top]);
}
}
}