倍增求LCA

 

#include <bits/stdc++.h>
using namespace std;
const int N = 5e5+1000;
int fa[N][20];
int deep[N];
vector<int> edge[N];
void dfs(int u, int f, int d) {
    deep[u] = d;
    fa[u][0] = f;
    for(auto v:edge[u]) {
        if(v == f) continue;
        dfs(v, u, d+1);
    }
}
void init(int n) {
    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 lca(int u, int v){
    if(deep[u] < deep[v]) swap(u, v);
    int diff = deep[u] - deep[v];
    for(int i = 19; i >= 0; i--)
        if(diff>>i&1)
            u = fa[u][i];
    if(u == v) return u;
    for(int i = 19; i >= 0; i--)
        if(fa[u][i] != fa[v][i]) {
            u = fa[u][i];
            v = fa[v][i];
        }
    return fa[u][0];
}
int main(){
    int n, m, s; 
    scanf("%d%d%d", &n, &m, &s); //n个点，m条边，s为树根
    for(int i = 1; i <= n; i++) edge[i].clear();
    for(int i = 1; i < n; i++) {
        int u, v;
        scanf("%d%d",&u,&v);     //u-v有一条边
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    dfs(s, 0, 1);
    init(n);
    for(int i = 1; i <= m; i++) {
        int u, v;
        scanf("%d%d", &u, &v);
        printf("%d\n", lca(u, v));
    }
    return 0;
}

求u->v路径上的最小边权

int fa[N][20],len[N][20];
int deep[N];
struct node{
    int u,v,w;
    node(){}
    node(int _u, int _v, int _w) {
        u = _u;
        v = _v;
        w = _w;
    }
}
vector<node> edge[N];
void dfs(int u, int f, int d,int w) {
    deep[u] = d;
    fa[u][0] = f;
    len[u][0] = w;
    for(auto x:edge[u]) {
        int v = x.v;
        int w = x.w;
        if(v == f) continue;
        dfs(v, u, d+1, w);
    }
}
void init(int n) {
    for(int j = 1; j <= 19; j++)
        for(int i = 1; i <= n; i++) {
            fa[i][j] = fa[fa[i][j-1]][j-1];
            len[i][j] = min(len[i][j-1],len[fa[i][j-1]][j-1]);
        }
}
int lca(int u, int v){
    int ans = 1e9;
    if(deep[u] < deep[v]) swap(u, v);
    int diff = deep[u] - deep[v];
    for(int i = 19; i >= 0; i--)
        if(diff>>i&1) {
            ans = min(ans,len[u][i]);
            u = fa[u][i];
        }
    if(u == v) return ans;
    for(int i = 19; i >= 0; i--)
        if(fa[u][i] != fa[v][i]) {
            ans = min(ans,len[u][i]);
            u = fa[u][i];
            ans = min(ans,len[v][i]);
            v = fa[v][i];
        }
    return min(ans,min(len[u][0],len[v][0]));
}