倍增LCA算法
基本思想为先把两个结点调整到同一深度, 然后同时往上走, 直到两个结点相等。
要完成这些, 除了记录左右儿子, 还要记录父节点以及各结点深度
时间复杂度:
遍历树获取深度 O(n)
获取祖先 O(logn)
对于每个样例, 要进行m次查询和1次遍历, 因此总的时间复杂度为O(m*logn)
#include <iostream>
using namespace std;
const int N = 1e3 + 10;
int n, m;
int fa[N];
int l[N], r[N];
int d[N];
void dfs(int u, int depth) {
if (u == -1) return ;
d[u] = depth;
dfs(l[u], depth + 1);
dfs(r[u], depth + 1);
}
int getParent(int x1, int x2) {
if (d[x1] < d[x2]) return getParent(x2, x1);
while (d[x1] != d[x2]) x1 = fa[x1];
while (x1 != x2) x1 = fa[x1], x2 = fa[x2];
return x1;
}
int main() {
int _; cin >> _;
while (_ -- ) {
cin >> n >> m;
for (int i = 1, left, right; i <= n; ++ i) {
cin >> left >> right;
l[i] = left;
r[i] = right;
if (left != -1) fa[left] = i;
if (right != -1) fa[right] = i;
}
dfs(1, 1);
int x1, x2;
while (m -- ) {
cin >> x1 >> x2;
int parent = getParent(x1, x2);
cout << d[x1] + d[x2] - 2 * d[parent] << endl;
}
}
}