AHOI2008 紧急集合 LCA

题目大意：给一棵树，求三点之间最短距离， 并求最短距离所在的点。
题解：求出两两之间的LCA，观察可以发现，有两个LCA是相同的，且这个点一定在所有LCA中深度最浅。
画一个图可以发现，集合点就是另一个LCA，因为这个点是这三个点互相路径连接起来的公共点。
至于距离，找个例子可以发现距离是$dep[a]+dep[b]+dep[c]-dep[lca1]-dep[lca2]-dep[lca3]$，刚好是一个轮换式。。。所以答案就是他了

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN = 500001;
const int MAXM = 500001;

int fir[MAXN], nxt[MAXM << 1], to[MAXM << 1], cnt;
int dep[MAXN], fa[MAXN][20];

inline int read(){
	int k = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9'){k = k*10 + ch - '0'; ch = getchar();}
	return k * f;
}

inline void add_edge(int a, int b){
	to[cnt] = b;
	nxt[cnt] = fir[a];
	fir[a] = cnt++;
}

void dfs(int u, int f){
	dep[u] = dep[f] + 1; fa[u][0] = f;
	for(int i = 1; (1 << i) <= dep[u]; i++)
		fa[u][i] = fa[fa[u][i - 1]][i - 1];
	for(int i = fir[u]; i != -1; i = nxt[i]){
		int v = to[i];
		if(v == f) continue;
		dfs(v, u);
	}
}

int lca(int x, int y){
	if(dep[x] < dep[y]) swap(x, y);
	for(int i = 19; i >= 0; i--)
		if(dep[y] + (1 << i) <= dep[x])
			x = fa[x][i];
	if(x == y) return x;
	for(int i = 19; i >= 0; i--)
		if(fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
	return fa[x][0];
}

int main(){
	memset(fir, -1, sizeof(fir));
	int n = read(), m = read();
	for(int i = 1; i < n; i++){
		int a = read(), b = read();
		add_edge(a, b), add_edge(b, a);
	}
	dep[0] = -1;
	dfs(1, 0);
	for(int i = 1; i <= m; i++){
		int a = read(), b = read(), c = read(), ans;
		int lca1 = lca(a, b), lca2 = lca(b, c), lca3 = lca(a, c);
		if(lca1 == lca2) ans = lca3;
		else if(lca2 == lca3) ans = lca1;
		else if(lca3 == lca1) ans = lca2;
		printf("%d %d\n", ans, dep[a] + dep[b] + dep[c] - dep[lca1] - dep[lca2] - dep[lca3]);
	}
}