BZOJ 2588==Spoj 10628. Count on a tree

题目传送门：233333

在树上建一棵主席树然后乱搞就好了

L~R的路相当于[RT,L]+[RT,R]-[RT,LCA(L,R)]-[RT,FA[LCA(L,R)]]，多调一会就好了

bzoj上最后一行没有回车MDZZ不然会PE

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define rep(j,k,l) for (int j=k;j<=l;j++)
#define N 200005

using namespace std;
int n,m,cnt,st[N],to[N*2],ne[N*2],a[N],root[N];
int fa[N],deep[N],size[N],son[N],top[N],b[N];
struct _233{
	
	int l,r,sum;
	
}tr[10*N];

void add(int k,int l,int p){
	
	to[p]=l;
	ne[p]=st[k];
	st[k]=p;
	
}

void stree(int &k,int l,int r){
	
	k=++cnt;
	if (l==r) return;
	int mid=(l+r)/2;
	stree(tr[k].l,l,mid);
	stree(tr[k].r,mid+1,r);
	
}

void setree(int &k,int o,int l,int r,int p){
	
	k=++cnt;
	if (l==r){
		
		tr[k].sum=tr[o].sum+1;
		//printf("%d\n",l);
		return;
		
	}
	tr[k].l=tr[o].l;tr[k].r=tr[o].r;
	int mid=(l+r)/2;
	if (p<=mid) setree(tr[k].l,tr[o].l,l,mid,p);
	else setree(tr[k].r,tr[o].r,mid+1,r,p);
	tr[k].sum=tr[tr[k].l].sum+tr[tr[k].r].sum;
	
}

void dfs1(int rt,int dad){
	
	fa[rt]=dad;
	deep[rt]=deep[dad]+1;
	//printf("ok\n");
	setree(root[rt],root[fa[rt]],1,n,a[rt]);
	size[rt]=1;int _=0;
	for (int i=st[rt];i!=0;i=ne[i])
		if (to[i]!=dad){
			
			dfs1(to[i],rt);
			size[rt]+=size[to[i]];
			if (size[to[i]]>_){
				
				son[rt]=to[i];
				_=size[to[i]];
				
			}
			
		}
	
}

void dfs2(int rt,bool f){
	
	if (f) top[rt]=top[fa[rt]];
	else top[rt]=rt;
	if (son[rt]!=0) dfs2(son[rt],1);
	for (int i=st[rt];i!=0;i=ne[i])
		if (to[i]!=fa[rt]&&to[i]!=son[rt]) dfs2(to[i],0);
	
}

int lca(int x,int y){
	
	for (;top[x]!=top[y];x=fa[top[x]])
		if (deep[top[x]]<deep[top[y]]) swap(x,y);
	if (deep[x]>deep[y]) swap(x,y);
	return x;
	
}

int ask(int k,int l,int o,int p,int q,int ll,int rr){
	
	int mid=(ll+rr)/2;
	if (ll==rr) return mid;
	int w=tr[tr[k].l].sum+tr[tr[l].l].sum-tr[tr[o].l].sum-tr[tr[p].l].sum;
	//printf("%d %d %d %d %d %d\n",ll,rr,tr[tr[k].l].sum,tr[tr[l].l].sum,tr[tr[o].l].sum,tr[tr[p].l].sum);
	if (q>w) return ask(tr[k].r,tr[l].r,tr[o].r,tr[p].r,q-w,mid+1,rr);
	else ask(tr[k].l,tr[l].l,tr[o].l,tr[p].l,q,ll,mid);
	
}

int main(){
	
	scanf("%d%d",&n,&m);
	rep(i,1,n) scanf("%d",&a[i]),b[i]=a[i];
	sort(b+1,b+n+1);
	rep(i,1,n) a[i]=lower_bound(b+1,b+n+1,a[i])-b;
	rep(i,1,n-1){
		
		int k,l;
		scanf("%d%d",&k,&l);
		add(k,l,2*i-1);add(l,k,2*i);
		
	}
	deep[0]=1;
	stree(root[0],1,n);
	dfs1(1,0);
	dfs2(1,0);
	int ans=0;
	while (m--){
		
		int k,l,j;
		scanf("%d%d%d",&k,&l,&j);
		k^=ans;
		int o=lca(k,l);
		int p=fa[o];
		//printf("%d %d %d %d\n",k,l,o,p);
		ans=b[ask(root[k],root[l],root[o],root[p],j,1,n)];
		printf("%d",ans);
		if (m) printf("\n");
		
	}
	
}