hdu 2586 How far away ？【最近公共祖先】

http://acm.hdu.edu.cn/showproblem.php?pid=2586

题意：

题解：

tarjan算法离线算法模板（因为这个算法也是tarjan发明的） 代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 40040 , M = 80080;
int n , m;
struct Edge {
    int v , w , next;
    Edge () {}
    Edge (int v,int w,int next) :v(v) , w(w) , next(next) {}
}edge[M];
int E , head[N];
int f[N];
void init() {
    E = 0; memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int w) {
    edge[E] = Edge(v , w , head[u]); head[u] = E++;
    edge[E] = Edge(u , w , head[v]); head[v] = E++;
}
int find(int x) {
    return x == f[x] ? x : f[x] = find(f[x]);
}
Edge edge2[M];
int E2 , head2[N];
void init2() {
    E2 = 0; memset(head2,-1,sizeof(head2));
}
void addedge2(int u,int v,int w) {
    edge2[E2] = Edge(v , w , head2[u]); head2[u] = E2++;
    edge2[E2] = Edge(u , w , head2[v]); head2[v] = E2++;
}
bool vis[N];
int res[N][3] , dist[N];
void tarjan(int u) {
    vis[u] = true;
    f[u] = u;
    for(int i=head2[u];i!=-1;i=edge2[i].next)
        if(vis[edge2[i].v])
            res[edge2[i].w][2] = find(edge2[i].v);
    for(int i=head[u];i!=-1;i=edge[i].next)
        if(!vis[edge[i].v]) {
            dist[edge[i].v] = dist[u] + edge[i].w;
            tarjan(edge[i].v);
            f[edge[i].v] = u;
        }
}
int main() {
    int T;
    scanf("%d" , &T);
    while(T--) {
        scanf("%d%d",&n,&m);
        init(); init2();
        for(int i=1;i<n;i++) {
            int u  ,v , w;
            scanf("%d%d%d",&u,&v,&w);
            addedge(u,v,w);
        }
        for(int i=1;i<=m;i++) {
            int u , v;
            scanf("%d%d",&u,&v);
            addedge2(u,v,i);
            res[i][0] = u;
            res[i][1] = v;
        }
        memset(vis,0,sizeof(vis));
        dist[1] = 0;
        tarjan(1);
        for(int i=1;i<=m;i++)
            printf("%d\n", dist[res[i][0]]+dist[res[i][1]]-2*dist[res[i][2]]);
    }
    return 0;
}