HDU - 2586 How far away ?(lca tarjan离线)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2586

题意：lca模板题，树上两点之间距离。

思路：先求出根节点到每个点的距离，然后求出每组查询的lca，ans=d[u]+d[v]-2*d[lca]就行了。

代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define fuck(x) cout<<"<"<<x<<">"<<endl
#define fi first
#define se second
#define pb push_back 
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const double PI = acos(-1.0);
const LL INFLL = 0x3f3f3f3f3f3f3f3fll;
const int maxn = 4e4 + 5;
const int mod = 1e9 + 7;
const int big = 1e18;


int t;
int n,m;
struct edge{
	int to,cost;
};
vector<edge>G[maxn];
struct query{
	int num,id;
};
vector<query>q[maxn];
int p[maxn],vis[maxn];
int ast[maxn];
int dis[maxn];
int ans[maxn];
void init() {
	for (int i=0;i<maxn;i++) p[i]=i,vis[i]=0,G[i].clear(),q[i].clear(),dis[i]=0;
}
int Find(int x){
	return p[x]==x?x:(p[x]=Find(p[x]));
}
void unite(int x,int y){
	x=Find(x);
	y=Find(y);
	if (x!=y) p[x]=y;
}
void tarjan(int x,int pre){
	for (int i=0;i<G[x].size();i++){
		edge e=G[x][i];
		if (e.to==pre) continue;
		dis[e.to]=dis[x]+e.cost;
		tarjan(e.to,x);
		unite(x,e.to);
		ast[Find(x)]=x;
	}
	vis[x]=1;
	for (int i=0;i<q[x].size();i++){
		int to=q[x][i].num,id=q[x][i].id;
		if (vis[to]) {
			ans[id]=dis[x]+dis[to]-2*dis[ast[Find(to)]];
		}
	}
}
int main() {
	scanf ("%d",&t);
	while (t--){
		init();
		scanf ("%d%d",&n,&m);
		for (int i=0;i<n-1;i++) {
			int u,v,cost;
			scanf ("%d%d%d",&u,&v,&cost);
			G[u].pb(edge{v,cost});
			G[v].pb(edge{u,cost});
		}
		for (int i=1;i<=m;i++){
			int u,v;
			scanf ("%d%d",&u,&v);
			q[u].pb(query{v,i});
			q[v].pb(query{u,i});
		}
		dis[1]=0;
		tarjan(1,1);
		for (int i=1;i<=m;i++){
			printf ("%d\n",ans[i]);
		}
	}
    return 0;
}