HDU 3078 Network LCA + 排序

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

题意：给定一棵树，树上每个点都有权值，有两种操作: k a b，k == 0时把a点的权值改为b，k > 0时求a到b路径上第k大的权值

思路：k == 0时直接改权值即可，求k大值时求出a到b的LCA，然后分别从a和b出发走到LCA，记录下路径上的权值，排序输出第k大即可

总结：数据很菜，这样都能过。。。还有本题中的第k大真的是第k大，而有的题说是第k大其实是第k小，害得我哇了两次。。。

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

const int N = 100010;
struct edge
{
    int to, next;
}g[N*2];
int cnt, head[N];
int tot, dep[N*2], ver[N*2], fat[N], fir[N], dp[20][N*2];
bool vis[N];
int a[N];
int n, m;
void add_edge(int v, int u)
{
    g[cnt].to = u, g[cnt].next = head[v], head[v] = cnt++;
}
void dfs(int v, int fa, int cur)
{
    vis[v] = true, ver[++tot] = v, dep[tot] = cur, fir[v] = tot, fat[v] = fa;
    for(int i = head[v]; i != -1; i = g[i].next)
    {
        int u = g[i].to;
        if(! vis[u])
        {
            dfs(u, v, cur + 1);
            ver[++tot] = v, dep[tot] = cur;
        }
    }
}
void ST(int n)
{
    for(int i = 1; i <= n; i++)
        dp[0][i] = i;
    for(int i = 1; (1<<i) <= n; i++)
        for(int j = 1; j <= n - (1<<i) + 1; j++)
            dp[i][j] = dep[dp[i-1][j]] < dep[dp[i-1][j+(1<<(i-1))]] ? dp[i-1][j] : dp[i-1][j+(1<<(i-1))];
}
int RMQ(int l, int r)
{
    int k = log(r - l + 1) / log(2);
    return dep[dp[k][l]] < dep[dp[k][r-(1<<k)+1]] ? dp[k][l] : dp[k][r-(1<<k)+1];
}
int LCA(int v, int u)
{
    v = fir[v], u = fir[u];
    if(v > u) swap(v, u);
    int res = RMQ(v, u);
    return ver[res];
}
int main()
{
    while(~ scanf("%d%d", &n, &m))
    {
        for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
        cnt = 0;
        memset(head, -1, sizeof head);
        for(int i = 1; i <= n - 1; i++)
        {
            int v, u;
            scanf("%d%d", &v, &u);
            add_edge(v, u), add_edge(u, v);
        }
        tot = 0;
        memset(vis, 0, sizeof vis);
        dfs(1, 0, 1);
        ST(2 * n - 1);
        int tmp[N], num;
        for(int i = 1; i <= m; i++)
        {
            int k, v, u;
            scanf("%d%d%d", &k, &v, &u);
            if(k == 0) a[v] = u;
            else
            {
                num = 0;
                int lca = LCA(v, u);
                while(v != lca) tmp[num++] = a[v], v = fat[v];
                while(u != lca) tmp[num++] = a[u], u = fat[u];
                tmp[num++] = a[lca];
                sort(tmp, tmp + num, greater<int>());
                if(k > num) printf("invalid request!\n");
                else printf("%d\n", tmp[k-1]);
            }
        }
    }
    return 0;
}