蒟蒻复习之-----LCA

#蒟蒻复习之-----LCA#

---

//这两年考LCA考的特别多，QAQ
//重要不重要自己体会

#1.Tarjan#
都说tarjan的好写，一直没看过
今天看了看挺简单的，比倍增的好写多了
//个人比较喜欢打多个函数，代码有点长

模版题

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int maxn = 500000 + 100;
int n,m,s;
struct edge {
	int u,v,next;
}e[maxn<<1];
int head[maxn], tot = 0;
struct node {
	int val,u,v,next;
}no[maxn<<1];
int he[maxn],cnt = 0,f[maxn];

int read() {
    int x = 0, t = 1;
    char ch = getchar();
    while(ch < '0' || ch >'9'){
        if(ch == '-') t = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * t;
}


int find(int x){
    if(f[x] == x) return f[x];
    f[x] = find(f[x]);
    return f[x];
}

int merge(int u,int v) {
    int t1 = find(u);
    int t2 = find(v);
    if(t1 != t2) {
        f[t2] = t1;
    }
}

void add(int u, int v) {
	e[++tot] = (edge){u,v,head[u]};
	head[u] = tot;
}

void add1(int u, int v,int num) {
	no[++cnt] = (node){num,u,v,he[u]};
	he[u] = cnt;
}

int vis[maxn],lca[maxn];

void init() {
	for(int i = 1;i <= n;i++) f[i] = i;
}

void tarjan(int x) {
	vis[x] = 1;
	for(int i =head[x]; i; i = e[i].next) {
		int v = e[i].v;
		if(!vis[v]) {
			tarjan(v);
			merge(x,v);
		}
	}
	for(int i =he[x]; i; i = no[i].next) {
		int v = no[i].v;
		if(vis[v]) lca[no[i].val] = find(v); 
	}
}

int main() {
	n = read(), m = read(), s = read();
	for(int i = 1; i < n; i++) {
		int u = read(), v = read();
		add(u,v);
		add(v,u);
	}
	for(int i = 1; i <= m; i++) {
		int u = read(), v = read();
		add1(u,v,i);
		add1(v,u,i);
	}
	init();
	tarjan(s);
	for(int i = 1; i <= m;i++) {
		cout<<lca[i]<<endl;
	}
	return 0;
}

#2.倍增#

模版题
//特别坑，卡了我的输出

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

const int maxn = 500000 + 100;
int n,m,s;
struct edge {
    int u,v,next;
}e[maxn<<1];
int head[maxn], tot = 0;
int dep[maxn],f[maxn][30],vis[maxn],lg[maxn];

int read() {
    int x = 0, t = 1;
    char ch = getchar();
    while(ch < '0' || ch >'9'){
        if(ch == '-') t = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x * t;
}

void add(int u, int v) {
    e[++tot] = (edge){u,v,head[u]};
    head[u] = tot;
}

void dfs(int x) {
    for(int i = head[x]; i; i = e[i].next) {
        int v = e[i].v;
        if(!vis[v]) {
            vis[v] = 1;
            dep[v] = dep[x] + 1;
            f[v][0] = x;
            dfs(v);
        }
    }
}

void init() {
    for(int j = 1; j <= 20; j++) {
        for(int i = 1; i <= n; i++) {
            f[i][j] = f[f[i][j-1]][j-1];
        }
    }
}

int Lca(int x, int y) {
    if(dep[x] < dep[y]) swap(x,y);
    for(int i = 20; i >= 0; i--) {
        if(dep[f[x][i]] >= dep[y]) {
            x = f[x][i];
        }
    }
    if(x == y) return x;
    for(int i = 20; i >= 0; i--) {
        if(f[x][i] != f[y][i]) {
            x = f[x][i];
            y = f[y][i];
        }
    }
    return f[x][0];
}

int main() {
    n = read(), m = read(), s = read();
    for(int i = 1; i < n; i++) {
        int u = read(), v = read();
        add(u,v);
        add(v,u);
    }
    vis[s] = 1;
    dfs(s);
    init();
    for(int i = 1; i <= m; i++) {
        int u = read(), v = read();
        printf("%d\n",lca(u,v));
    }
    return 0;
}

#其他扩展#
##1.求路径##
记录一个len数组，len[i]表示节点i到根节点的距离
对任意的两个节点u，v其距离为 len[u]+len[v]-2*len[lca(u,v)]

##2.求路上最长路和最短路##
预处理

for(int j = 1; (1<<j) < n; j++) {
        for(int i = 1; i <= n; i++) {
            f[i][j] = f[f[i][j-1]][j-1];
            d[i][j] = max(d[f[i][j-1]][j-1],d[i][j]);
            //min为
	            // d[i][j] = min(d[f[i][j-1]][j-1],d[i][j]);
        }
    }

查找lca时

int Lca(int x, int y) {
    if(dep[x] < dep[y]) swap(x,y);
    int sum = 0;
    for(int i = 20; i >= 0; i--) {
        if(dep[f[x][i]] >= dep[y]) {
            x = f[x][i];
            sum = max(sum, d[x][j]);
        }
    }
    if(x == y) return x;
    for(int i = 20; i >= 0; i--) {
        if(f[x][i] != f[y][i]) {
            x = f[x][i];
            y = f[y][i];
            sum = max(sum, d[x][j]);
            sum = max(sum, d[y][j]);
        }
    }
    sum = max(sum, d[x][0]);
    sum = max(sum, d[y][0]);
    return f[x][0];
}