hdu 2586 How far away ？

lca问题，使用倍增算法求解。

#pragma comment (linker, "/STACK:1024000000, 1024000000")
#include <map>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int MAX = 40010;
struct edge{
	int v, w, next;
}node[MAX << 1];

int n,m;
int cnt,head[MAX];
int f[MAX],d[MAX],deep[MAX],p[MAX][20];

void addedge(int u, int v, int w){
	node[cnt].v = v;
	node[cnt].w = w;
	node[cnt].next = head[u];
	head[u] = cnt++;
}

void dfs(int u, int pre, int t){//预处理深度和到根节点的距离
	deep[u] = t, f[u] = pre;
	for(int i=head[u]; i!=-1; i=node[i].next){
		int v = node[i].v;
		if(v != pre){
			d[v] = d[u] + node[i].w;
			dfs(v, u, t+1);
		}
	}
}

void init(){//记录<strong>各个点的2^j祖先是谁 ,其中      2^j      (j      =0...log(该点深度))倍祖先，1倍祖先就是父亲，2倍祖先是父亲的父亲......</strong>
	for(int j=0; (1<<j)<=n; j++)
		for(int i=1; i<=n; i++)
			p[i][j] = -1;
	for(int i=1; i<=n; i++) p[i][0] = f[i];
	for(int j=1; (1<<j)<=n; j++)
		for(int i=1; i<=n; i++)
			if(p[i][j-1] != -1)
				p[i][j] = p[p[i][j-1]][j-1];
}

int lca(int a, int b){
	int i, j;
	if(deep[a] < deep[b]) swap(a, b);
	for(i=0; (1<<i)<=deep[a]; i++);
	for(j=i-1; j>=0; j--)
		if(deep[a] - (1 << j) >= deep[b])
			a = p[a][j];
	if(a == b) return a;
	for(j=i-1; j>=0; j--){
		if(p[a][j] != -1 && p[a][j] != p[b][j]){
			a = p[a][j];
			b = p[b][j];
		}
	}
	return f[a];
}

int main(){
	int cas;
	scanf("%d",&cas);
	while(cas--){
		scanf("%d%d",&n,&m);
		cnt = 0;
		memset(head, -1, sizeof(head));
		for(int i=0; i<n-1; i++){
			int u, v, w;
			scanf("%d%d%d",&u,&v,&w);
			addedge(u, v, w);
			addedge(v, u, w);
		}
		d[1] = 0;
		dfs(1, -1, 0);
		init();
		for(int i=0; i<m; i++){
			int a,b;
			scanf("%d%d",&a,&b);
			int ans = d[a] + d[b] - 2*d[lca(a, b)];
			printf("%d\n",ans);
		}
	}	
	return 0;
}