HDOJ-2586 How far away ？(在线LCA)

这道题求树中任意两点之间的距离。设dis[i]为i到根节点的距离，给任意两个点i,j,只要求出i和j的最近公共祖先h，则i和j的距离 = dis[i] + dis[j] - 2*dis[h].
求最近公共祖先则用在线LCA, DFS+ST;

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <stack>
#include <queue> 
#include <cmath>
#define maxn 40005
#define INF 1e9
typedef long long ll;
using namespace std;

struct Edge{
    Edge(int a, int b, int c){
        from = a;
        to = b;
        dis = c;
    }
    int from, to;
    int dis;
};
vector<Edge> edge;
vector<int> v[maxn]; 
int p[maxn*2], d1[maxn*2], vis[maxn], d2[maxn], dp[maxn*2][20];
int len;
void dfs(int h, int f, int m){

    vis[h] = len;
    d1[len]= m;
    p[len++] = h;
    for(int i = 0; i < v[h].size(); i++){
        Edge &k = edge[v[h][i]];
        if(k.to != f){
            d2[k.to] = d2[k.from] + k.dis;
            dfs(k.to, k.from, m+1);
            vis[h] = len;
            d1[len]= m;
            p[len++] = h;
        } 
    } 
}
void ST(){

    for(int i = 0; i < len; i++)
     dp[i][0] = i;
    for(int j = 1; (1<<j) <= len; j++)
     for(int i = 0; i+(1<<j) <= len; i++){
        int k1 = dp[i][j-1];
        int k2 = dp[i+(1<<(j-1))][j-1];
        if(d1[k1] < d1[k2])
         dp[i][j] = k1;
        else
         dp[i][j] = k2;
     }
}
int main(){

//  freopen("in.txt", "r", stdin);
    int t;

    scanf("%d", &t); 

    while(t--){

        int n, m, a, b, c;

        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; i++)
         v[i].clear();
        edge.clear();
        for(int i = 1; i < n; i++){
            scanf("%d%d%d", &a, &b, &c);
            edge.push_back(Edge(a, b, c));
            edge.push_back(Edge(b, a, c));
            int k = edge.size();
            v[a].push_back(k-2);
            v[b].push_back(k-1);

        }
        d2[1] = 0;
        len = 0;
        dfs(1, -1, 0);
        ST();
        for(int i = 0; i < m; i++){
            scanf("%d%d", &a, &b);
            int k1 = vis[a];
            int k2 = vis[b];
            if(k1 > k2)
             swap(k1, k2);
            int h = log2(k2-k1+1);
            int k3 = dp[k1][h];
            int k4 = dp[k2-(1<<h)+1][h];
            if(d1[k3] < d1[k4])
             k1 = k3;
            else
             k1 = k4;
            k1 = p[k1];
            printf("%d\n", d2[a]+d2[b]-2*d2[k1]);
        }
    }
    return 0;
}