HDU 3078 - Network(LCA'ST算法)

题目：http://acm.hdu.edu.cn/showproblem.php?pid=3078

题意：n个点，每个点都有权值，n-1条边，q个询问，k=0是将点a的权值改为b，k>0时求出点a到b路径中第k大的权值。

思路：预处理的dfs中 使用pre数组记录每个点的前驱。

求出a，b 的最近公共祖先lca，记录路径，将路径的点的权值排序，输出第k大的点值。

AC.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int maxn = 80005;
int val[maxn];

struct Edge {
    int to, next;
}edge[maxn*2];
int head[maxn], tot;
void addedge(int u, int v)
{
    edge[tot].to = v;
    edge[tot].next = head[u];
    head[u] = tot++;
    edge[tot].to = u;
    edge[tot].next = head[v];
    head[v] = tot++;
}

bool vis[maxn];
int ver[2*maxn], R[2*maxn], first[maxn], pre[maxn], tt;
//ver:节点编号 R:深度 first:点编号位置
void dfs(int u, int dep)
{
    vis[u] = 1;
    ver[++tt] = u;
    first[u] = tt;
    R[tt] = dep;
    for(int i = head[u]; i != -1; i = edge[i].next) {
        int v = edge[i].to;
        if(!vis[v]) {
            pre[v] = u;
            dfs(v, dep+1);
            ver[++tt] = u;
            R[tt] = dep;
        }
    }
}

int dp[2*maxn][30];
void ST(int n)
{
    for(int i = 1; i <= n; ++i)
        dp[i][0] = i; //下标
    for(int j = 1; (1<<j) <= n; ++j) {
        for(int i = 1; i+(1<<j)-1 <= n; ++i) {
            int a = dp[i][j-1], b = dp[i+(1<<(j-1))][j-1];
            dp[i][j] = R[a] < R[b]? a: b;
        }
    }
}
int RMQ(int l, int r)
{
    int k = 0;
    while((1<<(k+1)) <= r-l+1) k++;
    int a = dp[l][k], b = dp[r-(1<<k)+1][k];
    return R[a] < R[b]? a: b;
}
int LCA(int u, int v)
{
    int x = first[u], y = first[v];
    if(x > y) swap(x, y);
    int res = RMQ(x, y);
    return ver[res];
}

int ans[maxn];
bool cmp(int a, int b) { return a > b; }
void solve(int k, int u, int v)
{
    int p = 0;
    int lca = LCA(u, v);
    for(int i = u; i != lca; i = pre[i]) ans[p++] = val[i];
    for(int i = v; i != lca; i = pre[i]) ans[p++] = val[i];
    ans[p++] = val[lca];
    if(p < k) {
        printf("invalid request!\n");
    }
    else {
        sort(ans, ans+p, cmp);
        printf("%d\n", ans[k-1]);
    }
}

void init()
{
    tot = 0;
    tt = 0;
    memset(head, -1, sizeof(head));
    memset(vis, 0, sizeof(vis));
    memset(pre, -1, sizeof(pre));
}

int main()
{
    //freopen("in", "r", stdin);
    int n, q;
    while(~scanf("%d %d", &n, &q)) {
        init();
        for(int i = 1; i <= n; ++i) {
            scanf("%d", &val[i]);
        }

        int u, v, k;
        for(int i = 0; i < n-1; ++i) {
            scanf("%d %d", &u, &v);
            addedge(u, v);
        }

        dfs(1, 1);
        ST(2*n-1);

        for(int i = 0; i < q; ++i) {
            scanf("%d %d %d", &k, &u, &v);
            if(k == 0) {
                val[u] = v;
            }
            else {
                solve(k, u, v);
            }
        }
    }
    return 0;
}