bzoj1787（倍增lca）

easy，只要分三种情况，取最大值即可

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=500009;
struct aa
{
	int to,pre;
}edge[maxn*2];
int head[maxn],tot;
int f[maxn][26],dep[maxn];
int n,m,ansp,ansc,ans;
void addedge(int x,int y)
{
	edge[++tot].to=y;edge[tot].pre=head[x];head[x]=tot;
}
void dfs(int u,int depth)
{
	dep[u]=depth;
	int j=1;
	while ((1<<j)<depth)
	{
		f[u][j]=f[f[u][j-1]][j-1];
		j++;
	}
	for (int i=head[u];i;i=edge[i].pre)
	if (dep[edge[i].to]==0)
	{
		int v=edge[i].to;
		f[v][0]=u;
		dfs(v,depth+1);
	}
}
void up(int &u,int step)
{
	for (int i=0;i<=22;i++)
	if ((1<<i)&step)
	{
		ans+=(1<<i);
		u=f[u][i];
	}
}
int find(int u,int v)
{
	if (dep[u]>dep[v]) up(u,dep[u]-dep[v]);
	else up(v,dep[v]-dep[u]);
	for (int i=22;i>=0;i--)
	if (f[u][i]!=f[v][i])
	{
		ans+=1<<(i+1);
		u=f[u][i];v=f[v][i];
	}
	if (u!=v) ans+=2,u=f[u][0];
	return u;
}
void work(int x,int y,int z)
{
	ans=0;
	int p=find(x,y);
	int pp=find(p,z);
	if (ans<ansc) ansc=ans,ansp=p;
}
int main()
{
	scanf("%d%d",&n,&m);
	int x,y,z;
	for (int i=1;i<n;i++)
	{
		scanf("%d%d",&x,&y);
		addedge(x,y);
		addedge(y,x);
	}
	dfs(1,1);
	for (int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&z);
		ansc=0x3f3f3f3f;ansp=0;
		work(x,y,z);
		work(x,z,y);
		work(z,y,x);
		printf("%d %d\n",ansp,ansc);
	}
	return 0; 
}