POJ1330 dfs + ST模板 LCA

最新推荐文章于 2022-01-27 11:36:52 发布

BranZhai

最新推荐文章于 2022-01-27 11:36:52 发布

阅读量133

点赞数

分类专栏：模板图 LCA

本文链接：https://blog.csdn.net/weixin_44758733/article/details/108304980

版权

图同时被 3 个专栏收录

13 篇文章 0 订阅

订阅专栏

模板

6 篇文章 0 订阅

订阅专栏

LCA

5 篇文章 0 订阅

订阅专栏

https://vjudge.net/problem/POJ-1330

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

const int MAXV = 10005;

int rmq[MAXV << 1];
int n;
struct ST {
        int lg[MAXV << 1];
        int dp[MAXV << 1][20];

        void init(int n) {
                lg[0] = -1;
                for (int i = 1; i <= n; ++i) {
                        lg[i] = ((i & (i - 1)) == 0) ? lg[i - 1] + 1 : lg[i - 1];
                        dp[i][0] = i;
                }

                for (int j = 1; j <= lg[n]; ++j)
                        for (int i = 1; i + (1 << j) - 1 <= n; ++i)
                                dp[i][j] = rmq[dp[i][j - 1]] < rmq[dp[i + (1 << (j - 1))][j - 1]]
                                        ? dp[i][j - 1] : dp[i + (1 << (j - 1))][j - 1];
        }

        int query(int x, int y) {
                if (x > y) swap(x, y);
                int k = lg[y - x + 1];
                return rmq[dp[x][k]] <= rmq[dp[y - (1 << k) + 1][k]]
                        ? dp[x][k] : dp[y - (1 << k) + 1][k];
        }
}st;

struct Edge {
        int to, nxt;
}edge[MAXV << 1];

int tol;
int head[MAXV];
void addedge(int u, int v) {
        ++tol;
        edge[tol].to = v; edge[tol].nxt = head[u];
        head[u] = tol;
}

int F[MAXV << 1];
int pos[MAXV];
int tot;
void dfs(int u, int pu, int d) {
        F[++tot] = u;
        pos[u] = tot;
        rmq[tot] = d;
        for (int i = head[u]; i != -1; i = edge[i].nxt) {
                int v = edge[i].to;
                if (v == pu) continue;
                dfs(v, u, d + 1);
                F[++tot] = u;
                rmq[tot] = d;
        }
}

bool vis[MAXV];
void init() {
        tol = tot = 0;
        memset(vis, false, sizeof vis);
        memset(head, -1, sizeof head);
}

int lca_query(int x, int y) {
        return F[st.query(pos[x], pos[y])];
}

int main() {
        int q;
        scanf("%d", &q);
        while (q--) {
                init();
                scanf("%d", &n);
                for (int i = 1; i < n; ++i) {
                        int u, v;
                        scanf("%d%d", &u, &v);
                        addedge(u, v);
                        addedge(v, u);
                        vis[v] = true;
                }

                int root = 1;
                for (int i = 1; i <= n; ++i)
                        if (!vis[i]) {
                                root = i;
                                break;
                        }

                dfs(root, -1, 0);
                st.init(2 * n - 1);
                int x, y;
                scanf("%d%d", &x, &y);
                printf("%d\n", lca_query(x, y));
        }
        return 0;
}