tjut 2586

</pre><pre name="code" class="cpp">

<pre name="code" class="cpp">1.离线做法
#include <iostream>  
#include <string.h>  
#include <stdio.h>  
#include <vector>  
  
using namespace std;  
const int N = 50005;  
  
vector<int> v[N],w[N],query[N],num[N];  
int pre[N],dist[N],ans[N];  
bool vis[N];  
int n;  
  
void Init()  
{  
    for(int i=1; i<=n; i++)  
    {  
        v[i].clear();  
        w[i].clear();  
        query[i].clear();  
        num[i].clear();  
        pre[i] = i;  
        dist[i] = 0;  
        vis[i] = false;  
    }  
}  
  
int Find(int x)  
{  
    if(pre[x] != x)  
        pre[x] = Find(pre[x]);  
    return pre[x];  
}  
  
void Union(int x,int y)  
{  
    x = Find(x);  
    y = Find(y);  
    if(x == y) return;  
    pre[y] = x;  
}  
  
void Tarjan(int cur,int val)  
{  
    vis[cur] = true;  
    dist[cur] = val;  
    int size = v[cur].size();  
    for(int i=0;i<size;i++)  
    {  
        int tmp = v[cur][i];  
        if(vis[tmp]) continue;  
        Tarjan(tmp,val + w[cur][i]);  
        Union(cur,tmp);  
    }  
    int Size = query[cur].size();  
    for(int i=0;i<Size;i++)  
    {  
        int tmp = query[cur][i];  
        if(!vis[tmp]) continue;  
        ans[num[cur][i]] = dist[cur] + dist[tmp] - 2*dist[Find(tmp)];  
    }  
}  
  
int main()  
{  
    int T,Q,x,y,z;  
    scanf("%d",&T);  
    while(T--)  
    {  
        scanf("%d%d",&n,&Q);  
        Init();  
        for(int i=1;i<n;i++)  
        {  
            scanf("%d%d%d",&x,&y,&z);  
            v[x].push_back(y);  
            w[x].push_back(z);  
            v[y].push_back(x);  
            w[y].push_back(z);  
        }  
        for(int i=0;i<Q;i++)  
        {  
            scanf("%d%d",&x,&y);  
            query[x].push_back(y);  
            query[y].push_back(x);  
            num[x].push_back(i);  
            num[y].push_back(i);  
        }  
        Tarjan(1,0);  
        for(int i=0;i<Q;i++)  
           printf("%d\n",ans[i]);  
    }  
    return 0;  
} 

2.在线做法

#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <cmath>  
using namespace std;  
//#pragma comment(linker, "/STACK:102400000,102400000") //不需要申请系统栈  
const int N = 40010;  
const int M = 25;  
int dp[2*N][M];  //这个数组记得开到2*N，因为遍历后序列长度为2*n-1  
bool vis[N];  
struct edge  
{  
    int u,v,w,next;  
}e[2*N];  
int tot,head[N];  
inline void add(int u ,int v ,int w ,int &k)  
{  
    e[k].u = u; e[k].v = v; e[k].w = w;  
    e[k].next = head[u]; head[u] = k++;  
    u = u^v; v = u^v; u = u^v;  
    e[k].u = u; e[k].v = v; e[k].w = w;  
    e[k].next = head[u]; head[u] = k++;  
}  
int ver[2*N],R[2*N],first[N],dir[N];  
//ver:节点编号 R：深度 first：点编号位置 dir：距离  
void dfs(int u ,int dep)  
{  
    vis[u] = true; ver[++tot] = u; first[u] = tot; R[tot] = dep;  
    for(int k=head[u]; k!=-1; k=e[k].next)  
        if( !vis[e[k].v] )  
        {  
            int v = e[k].v , w = e[k].w;  
            dir[v] = dir[u] + w;  
            dfs(v,dep+1);  
            ver[++tot] = u; R[tot] = dep;  
        }  
}  
void ST(int n)  
{  
    for(int i=1;i<=n;i++)  
        dp[i][0] = i;  
    for(int j=1;(1<<j)<=n;j++)  
    {  
        for(int i=1;i+(1<<j)-1<=n;i++)  
        {  
            int a = dp[i][j-1] , b = dp[i+(1<<(j-1))][j-1];  
            dp[i][j] = R[a]<R[b]?a:b;  
        }  
    }  
}  
//中间部分是交叉的。  
int RMQ(int l,int r)  
{  
    int k=0;  
    while((1<<(k+1))<=r-l+1)  
        k++;  
    int a = dp[l][k], b = dp[r-(1<<k)+1][k]; //保存的是编号  
    return R[a]<R[b]?a:b;  
}  
  
int LCA(int u ,int v)  
{  
    int x = first[u] , y = first[v];  
    if(x > y) swap(x,y);  
    int res = RMQ(x,y);  
    return ver[res];  
}  
  
int main()  
{  
    //freopen("Input.txt","r",stdin);  
    //freopen("Out.txt","w",stdout);  
    int cas;  
    scanf("%d",&cas);  
    while(cas--)  
    {  
        int n,q,num = 0;  
        scanf("%d%d",&n,&q);  
        memset(head,-1,sizeof(head));  
        memset(vis,false,sizeof(vis));  
        for(int i=1; i<n; i++)  
        {  
            int u,v,w;  
            scanf("%d%d%d",&u,&v,&w);  
            add(u,v,w,num);  
        }  
        tot = 0; dir[1] = 0;  
        dfs(1,1);  
        /*printf("节点ver "); for(int i=1; i<=2*n-1; i++) printf("%d ",ver[i]); cout << endl; 
        printf("深度R "); for(int i=1; i<=2*n-1; i++) printf("%d ",R[i]);   cout << endl; 
        printf("首位first "); for(int i=1; i<=n; i++) printf("%d ",first[i]);    cout << endl; 
        printf("距离dir "); for(int i=1; i<=n; i++) printf("%d ",dir[i]);      cout << endl;*/  
        ST(2*n-1);  
        while(q--)  
        {  
            int u,v;  
            scanf("%d%d",&u,&v);  
            int lca = LCA(u,v);  
            printf("%d\n",dir[u] + dir[v] - 2*dir[lca]);  
        }  
    }  
    return 0;  
}