How far away ？ HDU - 2586 trajan算法lca

题意：树上查询两个点之间的距离

题解：必须离线，res[i]=d[u]+d[v]-2*d[lca(u,v)]；

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e5+10, INF = 0x3f3f3f3f;
#define mod 998244353
#define pi acos(-1.0)
int n,m,cnt1,cnt2;
int head1[maxn],head2[maxn];
int vis[maxn];ll d[maxn],res[maxn];
int fa[maxn];
struct node {
    int w,e,next;
    int lca;
}edge[maxn*2],que[maxn*2];

void add(int u,int v,int w){
    edge[cnt1].w=w;
    edge[cnt1].e=v;
    edge[cnt1].next=head1[u];
    head1[u]=cnt1++;
}
void add(int u,int v){
    que[cnt2].e=v;
    que[cnt2].next=head2[u];
    head2[u]=cnt2++;
}

void init(){
    memset(head1,0,sizeof(head1));
    memset(head2,0,sizeof(head2));
    memset(vis,0,sizeof(vis));
    memset(d,0,sizeof(d));
    for(int i=0;i<=n;i++)fa[i]=i;
    cnt1=1;cnt2=1;
}

int Find(int x){
    return