Network HDU - 3078

The ALPC company is now working on his own network system, which is connecting all N ALPC department. To economize on spending, the backbone network has only one router for each department, and N-1 optical fiber in total to connect all routers.
The usual way to measure connecting speed is lag, or network latency, referring the time taken for a sent packet of data to be received at the other end.
Now the network is on trial, and new photonic crystal fibers designed by ALPC42 is trying out, the lag on fibers can be ignored. That means, lag happened when message transport through the router. ALPC42 is trying to change routers to make the network faster, now he want to know that, which router, in any exactly time, between any pair of nodes, the K-th high latency is. He needs your help.

InputThere are only one test case in input file.
Your program is able to get the information of N routers and N-1 fiber connections from input, and Q questions for two condition: 1. For some reason, the latency of one router changed. 2. Querying the K-th longest lag router between two routers.
For each data case, two integers N and Q for first line. 0<=N<=80000, 0<=Q<=30000.
Then n integers in second line refer to the latency of each router in the very beginning.
Then N-1 lines followed, contains two integers x and y for each, telling there is a fiber connect router x and router y.
Then q lines followed to describe questions, three numbers k, a, b for each line. If k=0, Telling the latency of router a, Ta changed to b; if k>0, asking the latency of the k-th longest lag router between a and b (include router a and b). 0<=b<100000000.
A blank line follows after each case.
OutputFor each question k>0, print a line to answer the latency time. Once there are less than k routers in the way, print "invalid request!" instead.Sample Input

5 5
5 1 2 3 4
3 1
2 1
4 3
5 3
2 4 5
0 1 2
2 2 3
2 1 4
3 3 5

Sample Output

3
2
2
invalid request!
题解：单组case，适合Sparse Table来解。

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;

const int N = 8e4 + 10;

vector<int> G[N];

int n, q, dfsNum;
int vs[N << 1], dep[N << 1], first[N], Pa[N], va[N];

struct cmp {
    bool operator ()(int &a, int &b) {
        return a < b;
    }
};

void dfs(int u, int f, int d) {
    Pa[u] = f;
    vs[++dfsNum] = u;
    dep[dfsNum] = d;
    first[u] = dfsNum;
    for (int i = 0; i < G[u].size(); ++i) {
        int v = G[u][i];
        if (v == f) continue;
        dfs(v, u, d + 1);
        vs[++dfsNum] = u;
        dep[dfsNum] = d;
    }
}

inline int getMin(int x, int y) {
    return dep[x] < dep[y] ? x : y;
}

struct SparseTable {
    int dp[20][N << 1];
    void init(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 + (1 << i) - 1 <= n; ++j)
                dp[i][j] = getMin(dp[i - 1][j], dp[i - 1][j + (1 << i - 1)]);
    }
    int RMQ(int l, int r) {
        int k = 31 - __builtin_clz(r - l + 1);
        return getMin(dp[k][l], dp[k][r - (1 << k) + 1]);
    } 
} st;

inline int lca(int u, int v) {
    if (first[u] > first[v]) swap(u, v);
    int idx = st.RMQ(first[u], first[v]);
    return vs[idx];
}

void Inite() {
    dfsNum = 0;
    dfs(1, -1, 0);
    st.init(2 * n - 1);
}

void Solve(int u, int v, int k) {
    int Lca = lca(u, v);
    priority_queue<int, vector<int>, cmp>q;
    while (u != Lca) {
        q.push(va[u]);
        u = Pa[u];
    }
    while (v != Lca) {
        q.push(va[v]);
        v = Pa[v];
    }
    q.push(va[Lca]);
    for (int i = 1; (i < k) && (!q.empty()); i++) q.pop();
    if (q.empty()) printf_s("invalid request!\n");
    else printf_s("%d\n", q.top());
}

int main()
{
    scanf_s("%d%d", &n, &q);
    for (int i = 1; i <= n; i++) scanf_s("%d", va + i);
    for (int i = 2; i <= n; i++) {
        int u, v;
        scanf_s("%d%d", &u, &v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    Inite();
    for (int i = 1; i <= q; i++) {
        int k, u, v;
        scanf_s("%d%d%d", &k, &u, &v);
        if (k == 0) va[u] = v;
        else Solve(u, v, k);
    }
}