在x和y的所有公共祖先中,深度最大的称为最近公共祖先LCA(x, y)
一、模板
P3379 【模板】最近公共祖先(LCA) - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
1.倍增法求LCA
依靠二进制进行跳跃,总复杂度为
#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;
vector<int> g[N];
int cnt;
int fa[N][20], d[N];
void dfs(int now, int pre){
d[now] = d[pre] + 1;
fa[now][0] = pre;
//求fa数组,最多到根节点
for(int i = 1; (i << 1) <= d[now]; i++){
fa[now][i] = fa[fa[now][i - 1]][i - 1];
}
for(auto &nex : g[now]){
if(nex == pre) continue;
dfs(nex, now);
}
}
int LCA(int x, int y){
if(d[x] < d[y]) swap(x, y);
//(1)把x,y提到相同深度
for(int i = 19; i >= 0; i--){
if((d[x] - d[y]) >> i & 1) x = fa[x][i];
}
if(x == y) return x;
//(2)x,y同步往上跳
for(int i = 19; i >= 0; i--){
//祖先相等则跳过头了,i--继续跳
if(fa[x][i] != fa[y][i]){
x = fa[x][i], y = fa[y][i];
}
}
return fa[x][0];
}
int main() {
int n, m, root; cin >> n >> m >> root;
for(int i = 1; i < n; i++){
int u, v; cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
//计算每个点的深度并预处理fa数组
dfs(root, 0);
while(m--){
int x, y; cin >> x >> y;
int ans = LCA(x, y);
cout << ans << '\n';
}
}
2.Tarjan算法求LCA
离线算法,总复杂度为
咕
二、应用
1.树上差分
从u到v的一条树链,d[u]++, d[v]++, d[LCA(u, v)] -= 2 再用dfs把差分加起来
#include<bits/stdc++.h>
using namespace std;
#define qio ios::sync_with_stdio(0), cin.tie(0),cout.tie(0);
typedef long long ll;
typedef double db;
const int N = 1e5 + 10;
vector<int> g[N];
struct edge{
int u, v;
}e[N];
int dep[N],fa[N][20];
bool vis[N];
void dfs(int now, int pre){
dep[now] = dep[pre] + 1;
fa[now][0] = pre;
for(auto &nex : g[now]){
if(nex == pre) continue;
dfs(nex, now);
}
}
int LCA(int x, int y){
if(dep[x] < dep[y]) swap(x, y);
for(int i = 19; i >= 0; i--){
if((dep[x] - dep[y]) >> i & 1) x = fa[x][i];
}
if(x == y) return x;
for(int i = 19; i >= 0; i--){
if(fa[x][i] != fa[y][i]){
x = fa[x][i], y = fa[y][i];
}
}
return fa[x][0];
}
int d[N];
void dfsans(int now, int pre){
// cout << now << '!';
for(auto &nex : g[now]){
if(nex == pre) continue;
dfsans(nex, now);
d[now] += d[nex];
}
}
int main(){
int n; cin >> n;
for(int i = 1; i < n; i++){
int u, v; cin >> u >> v;
e[i].u = u, e[i].v = v;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1, 0);
for(int j = 1; j <= 19; j++){
for(int i = 1; i <= n; i++){
fa[i][j] = fa[fa[i][j - 1]][j - 1];
}
}
int m; cin >> m;
for(int i = 1; i <= m; i++){
int x, y; cin >> x >> y;
d[x]++, d[y]++;
d[LCA(x, y)] -= 2;
// cout << i << ' ' << LCA(x, y) << '\n';
}
// for(int i = 1; i <= n; i++) cout << d[i] << ' ';
// cout << '\n';
dfsans(1, 0);
// cout << '\n';
// for(int i = 1; i <= n; i++) cout << d[i] << ' ';
// cout << '\n';
for(int i = 1; i < n; i++){
int u = e[i].u, v = e[i].v;
if(dep[u] > dep[v]) cout << d[u] << '\n';
else cout << d[v] << '\n';
}
}