[主席树] BZOJ 2588 Spoj 10628. Count on a tree

题目大意：树上路径第k大 

裸题

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define V G[p].v
using namespace std;
typedef long long ll;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline void read(ll &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=100005;

ll sx[N],icnt;

inline int Bin(ll x){
	return lower_bound(sx+1,sx+icnt+1,x)-sx;
}

int n;
ll val[N];

int ncnt;
int root[N],ls[N*20],rs[N*20],sum[N*20];

void Modify(int &y,int x,int l,int r,int t){
	y=++ncnt; int mid=(l+r)>>1;
	if (l==r) { sum[y]=sum[x]+1; return; }
	if (t<=mid)
		rs[y]=rs[x],Modify(ls[y],ls[x],l,mid,t),sum[y]=sum[ls[y]]+sum[rs[y]];
	else
		ls[y]=ls[x],Modify(rs[y],rs[x],mid+1,r,t),sum[y]=sum[ls[y]]+sum[rs[y]];
}

int Query(int a,int b,int c,int d,int l,int r,int K){
	if (l==r) return sx[l];
	int mid=(l+r)>>1,tmp=sum[ls[a]]+sum[ls[b]]-sum[ls[c]]-sum[ls[d]];
	if (K<=tmp)
		return Query(ls[a],ls[b],ls[c],ls[d],l,mid,K);
	else
		return Query(rs[a],rs[b],rs[c],rs[d],mid+1,r,K-tmp);
}

struct edge{
	int u,v;
	int next;
};

edge G[2*N];
int head[N],inum;

inline void add(int u,int v,int p){
	G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}

int fat[N][21],depth[N];

inline void dfs(int u,int fa){
	fat[u][0]=fa; depth[u]=depth[fa]+1;
	for (int k=1;k<=20;k++) fat[u][k]=fat[fat[u][k-1]][k-1];
	Modify(root[u],root[fa],1,icnt,val[u]);
	for (int p=head[u];p;p=G[p].next)
		if (V!=fa)
			dfs(V,u);
}

inline int LCA(int u,int v){
	if (depth[u]<depth[v]) swap(u,v);
	for (int k=20;~k;k--)
		if ((depth[u]-depth[v])&(1<<k))
			u=fat[u][k];
	if (u==v) return u;
	for (int k=20;~k;k--)
		if (fat[u][k]!=fat[v][k])
			u=fat[u][k],v=fat[v][k];
	return fat[u][0];
}

int main()
{
	int Q,u,v,K;
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(Q);
	for (int i=1;i<=n;i++) read(val[i]),sx[++icnt]=val[i];
	sort(sx+1,sx+icnt+1); icnt=unique(sx+1,sx+icnt+1)-sx-1;
	for (int i=1;i<=n;i++) val[i]=Bin(val[i]);
	for (int i=1;i<n;i++)
		read(u),read(v),add(u,v,++inum),add(v,u,++inum);
	dfs(1,0);
	int last=0,lca;
	while (Q--){
		read(u); read(v); read(K); u^=last;
		lca=LCA(u,v);
		last=Query(root[u],root[v],root[lca],root[fat[lca][0]],1,icnt,K);
		Q?printf("%d\n",last):printf("%d",last);
	}	
	return 0;
}