UESTC 92 Journey(LCA)

题意：这题是给你一棵树，然后在两点之间再修一条新的路，然后q个询问，问你这两点之间原来的路径花费比修新路之后的花费多多少（如果更小，则输出0）

---

题解：先是倍增法预处理lca，然后怎么求走了新路之后的花费呢，如果这会查询的两点是x和y，新路的端点是a和b，不就是求min(cost(x,a)+cost(y,b),cost(x,b)+cost(y,a))，这个也能用lca解决
很简单的题

---

代码：

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")

using namespace std;
#define   MAX           100005
#define   MAXN          6005
#define   maxnode       15
#define   sigma_size    30
#define   lson          l,m,rt<<1
#define   rson          m+1,r,rt<<1|1
#define   lrt           rt<<1
#define   rrt           rt<<1|1
#define   middle        int m=(r+l)>>1
#define   LL            long long
#define   ull           unsigned long long
#define   mem(x,v)      memset(x,v,sizeof(x))
#define   lowbit(x)     (x&-x)
#define   pii           pair<int,int>
#define   bits(a)       __builtin_popcount(a)
#define   mk            make_pair
#define   limit         10000

//const int    prime = 999983;
const int    INF   = 0x3f3f3f3f;
const LL     INFF  = 0x3f3f;
const double pi    = acos(-1.0);
//const double inf   = 1e18;
const double eps   = 1e-8;
const LL    mod    = 1e9+7;
const ull    mx    = 133333331;

/*****************************************************/
inline void RI(int &x) {
      char c;
      while((c=getchar())<'0' || c>'9');
      x=c-'0';
      while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
 }
/*****************************************************/

const int MAXLOGV = 30;
struct Edge{
    int v,next,c;
}edge[MAX*2];
int head[MAX];
int tot;
int pre[MAXLOGV][MAX];
int dep[MAX];
int dis[MAX];

void init(){
    mem(head,-1);
    mem(pre,-1);
    tot=0;
}

void add_edge(int a,int b,int c){
    edge[tot]=(Edge){b,head[a],c};
    head[a]=tot++;
}

void dfs(int u,int fa,int d,int di){
    pre[0][u]=fa;
    dep[u]=d;
    dis[u]=di;
    for(int i=head[u];i!=-1;i=edge[i].next){
        int v=edge[i].v;
        if(v!=fa) dfs(v,u,d+1,di+edge[i].c);
    }
}

int lca(int u,int v){
    if(dep[u]>dep[v]) swap(u,v);
    for(int k=0;k<MAXLOGV;k++){
        if((dep[v]-dep[u])>>k & 1) v=pre[k][v];
    }
    if(v==u) return u;
    for(int k=MAXLOGV-1;k>=0;k--){
        if(pre[k][u]!=pre[k][v]){
            u=pre[k][u];
            v=pre[k][v];
        }
    }
    return pre[0][u];
}

int main(){
    int t,kase=0;
    cin>>t;
    while(t--){
        kase++;
        int n,q;
        cin>>n>>q;
        init();
        int xx,yy,zz;
        for(int i=1;i<n;i++){
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            add_edge(a,b,c);
            add_edge(b,a,c);
        }
        scanf("%d%d%d",&xx,&yy,&zz);
        dfs(1,-1,0,0);
        for(int k=0;k+1<MAXLOGV;k++){
            for(int v=1;v<=n;v++){
                if(pre[k][v]<0) pre[k+1][v]=-1;
                else pre[k+1][v]=pre[k][pre[k][v]];
            }
        }
        printf("Case #%d:\n",kase);
        while(q--){
            int a,b;
            scanf("%d%d",&a,&b);
            int u=lca(a,b);
            int aa=lca(a,xx);
            int aaa=lca(a,yy);
            int bb=lca(b,xx);
            int bbb=lca(b,yy);
            int tmp=min(dis[a]+dis[xx]-2*dis[aa]+zz+dis[b]+dis[yy]-2*dis[bbb],dis[a]+dis[yy]-2*dis[aaa]+zz+dis[b]+dis[xx]-2*dis[bb]);
            int ans=max(0,dis[a]+dis[b]-2*dis[u]-tmp);
            printf("%d\n",ans);
        }
    }
    return 0;
}