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
#d...
原创
2019-07-18 10:50:58 ·
291 阅读 ·
0 评论