题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=2586
题意:
求树上任意两点的距离
思路:
a,b两点的距离=根到a的距离+根到b的距离-2倍根到lca(a,b)的距离
dis[a]+dis[b]-2*dis[lca(a,b)]
代码如下:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<stack>
#include<cmath>
#include<set>
#include<map>
using namespace std;
#define ll long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
const int N=40015;
int head[N],cnt,vis[N],dis[N];
int depth[N],fa[N][22],lg[N];
struct A{
int to,nex,cost;
}edge[2*N];
void add(int from,int to,int cost){
edge[cnt].to=to;
edge[cnt].cost=cost;
edge[cnt].nex=head[from];
head[from]=cnt++;
}
void dfs(int now,int pre){
depth[now]=depth[pre]+1;
fa[now][0]=pre;
for(int i=1;(1<<i)<=depth[now];i++){
fa[now][i]=fa[fa[now][i-1]][i-1];
}
for(int i=head[now];i!=-1;i=edge[i].nex){
int v=edge[i].to;
if(v==pre)continue;
dis[v]=dis[now]+edge[i].cost;
dfs(edge[i].to,now);
}
}
int lca(int x,int y){
if(depth[x]<depth[y]){
swap(x,y);
}
while(depth[x]>depth[y]){
x=fa[x][lg[depth[x]-depth[y]]-1];
}
if(x==y)return x;
for(int k=lg[depth[x]]-1;k>=0;k--){
if(fa[x][k]!=fa[y][k]){
x=fa[x][k];
y=fa[y][k];
}
}
return fa[x][0];
}
int main(){
int n,m,s,t;
scanf("%d",&t);
for(int i=1;i<=40000;i++){
lg[i]=lg[i-1]+(1<<lg[i-1]==i);
}
while(t--){
scanf("%d%d",&n,&m);
memset(vis,0,sizeof(vis));
memset(head,-1,sizeof(head));
int a,b,c;
for(int i=1;i<n;i++){
scanf("%d%d%d",&a,&b,&c);
vis[b]=1;
add(a,b,c);
add(b,a,c);
}
for(int i=1;i<=n;i++){
if(vis[i]==0){
s=i;
break;
}
}
dfs(s,0);
for(int i=1;i<=m;i++){
scanf("%d%d",&a,&b);
printf("%d\n",dis[a]+dis[b]-2*dis[lca(a,b)]);
}
}
}