CodeForces - 1062E 区间lca

显然 询问的数量级比较大 那么就要快速求出区间的lca   

易得：区间lca是区间dfs序最大的点和区间dfs序最小的点的lca

那么我们 可以选择删除最大值点 或最小值点   在这两种情况下选 lca的深度最大的点就行

我用的是树剖求lca  实际上倍增应该更好写

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+100;
int n,m;
const int inf = 1e9;
#define pa pair<int,int>
pa Mx[N<<2],Mn[N<<2]; 
int cur,h[N],nex[N<<1],to[N<<1],f[N],dep[N],tid[N],tp[N],son[N],siz[N],cnt;
void add_edge(int x,int y){
	to[++cur]=y;nex[cur]=h[x];h[x]=cur;
}
void dfs1(int u){
	siz[u]=1;
	for(int i = h[u]; i; i = nex[i]){
		if(!dep[to[i]]){
			dep[to[i]]=dep[u]+1;
			f[to[i]]=u;
			dfs1(to[i]);
			siz[u]+=siz[to[i]];
			if(siz[to[i]]>siz[son[u]]) son[u]=to[i];
		}
	}
} 
void dfs2(int u,int t){
	tp[u]=t;tid[u]=++cnt;
	if(son[u]) dfs2(son[u],t);
	for(int i = h[u]; i; i = nex[i]){
		if(to[i]!=son[u]&&to[i]!=f[u])
		dfs2(to[i],to[i]);
	}
}
void pushup(int id){
	Mx[id]=max(Mx[id<<1],Mx[id<<1|1]);
	Mn[id]=min(Mn[id<<1],Mn[id<<1|1]);
}
int lca(int x,int y){
	while(tp[x]!=tp[y]){
		if(dep[tp[x]]<dep[tp[y]]) swap(x,y);
		x=f[tp[x]];
	}
	if(dep[x]<dep[y]) swap(x,y);
	return y;
}
void build(int id,int l,int r){
	if(l==r){
		Mx[id]=Mn[id]=make_pair(tid[l],l);
		return;
	}
	int mid = l+r>>1;
	build(id<<1,l,mid);build(id<<1|1,mid+1,r);
	pushup(id);
}
void update(int id,int l,int r,int pos,int fl){
	if(l==r){
		if(fl){
		Mx[id]=make_pair(0,l);
		Mn[id]=make_pair(inf,l);
		}else Mx[id]=Mn[id]=make_pair(tid[l],l);
		return;
	} 
	int mid = l+r>>1;
	if(pos<=mid) update(id<<1,l,mid,pos,fl);
	else update(id<<1|1,mid+1,r,pos,fl);
	pushup(id);
}
pa query(int id,int l,int r,int L,int R,int fl){
	if(L<=l&&R>=r){
		if(fl)
		return Mx[id];
		else return Mn[id];
	}
	int mid = l+r>>1;pa ans;
	if(fl) ans=make_pair(0,0);
	else ans=make_pair(inf,0);
	if(L<=mid) ans=fl?max(ans,query(id<<1,l,mid,L,R,fl)):min(ans,query(id<<1,l,mid,L,R,fl));
	if(R>mid) ans=fl?max(ans,query(id<<1|1,mid+1,r,L,R,fl)):min(ans,query(id<<1|1,mid+1,r,L,R,fl));
	return ans;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i = 2; i <= n; i++){
		int x;
		scanf("%d",&x);
		add_edge(x,i);	
	}
	dep[1]=1;
	dfs1(1);
	dfs2(1,1);
	build(1,1,n);
	
	for(int i = 1; i <= m; i++){
		int l,r;
		int ans,ansdep=-1;
		scanf("%d%d",&l,&r);
		pa nowx,nown;
		int lcaxn;
		pa mx = query(1,1,n,l,r,1),mn = query(1,1,n,l,r,0);
		//printf("mx=%d mn=%d\n",mx.second,mn.second);
		//printf("tidmx=%d tidmn=%d\n",tid[mx.second],tid[mn.second]);
		update(1,1,n,mx.second,1);
		nowx=query(1,1,n,l,r,1);
		lcaxn = lca(nowx.second,mn.second);
		if(dep[lcaxn]-1>ansdep) ans=mx.second,ansdep=dep[lcaxn]-1;
		update(1,1,n,mx.second,0);
		
		update(1,1,n,mn.second,1);
		nown=query(1,1,n,l,r,0);
		lcaxn = lca(mx.second,nown.second);
		if(dep[lcaxn]-1>ansdep) ans=mn.second,ansdep=dep[lcaxn]-1;
		update(1,1,n,mn.second,0);
		printf("%d %d\n",ans,ansdep);
	}
	return 0;
}