[BZOJ2286][SDOI2011]消耗战（虚树+树形DP）

看到题目的条件，容易想到是一道树形DP题，设$f[u]$为让$u$不能到达$u$的子树内（不包括$u$）的任意关键点（能源丰富的岛屿）的最小代价。如果$u$是叶子节点，那么$f[u]=0$。
转移就是枚举子节点$v$，设$val(u,v)$为边$(u,v)$的权值，则转移为：
如果$v$是关键点，那么$f[u]+=val(u,v)$。
否则$f[u]+=\min(val(u,v),f[v])$。
考虑到询问次数较大，但给出关键点的总数很少，因此可以构建出一个虚树。注意把 1 <script type="math/tex" id="MathJax-Element-13">1</script>号节点加入关键点。
如果对虚树不了解，可参考神犇zzq的博客：https://www.cnblogs.com/zzqsblog/p/5560645.html
构建完虚树后，就可以在虚树上DP了。注意虚树上一条边的边权为原树上这两点的路径上边权的最小值。
代码：

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
inline int read() {
    int res = 0; bool bo = 0; char c;
    while (((c = getchar()) < '0' || c > '9') && c != '-');
    if (c == '-') bo = 1; else res = c - 48;
    while ((c = getchar()) >= '0' && c <= '9')
        res = (res << 3) + (res << 1) + (c - 48);
    return bo ? ~res + 1 : res;
}
typedef long long ll;
const int N = 25e4 + 5, LogN = 23, INF = 0x3f3f3f3f;
int n, m, ecnt, nxt[N << 1], adj[N], go[N << 1], val[N << 1], dep[N], dfn[N],
times, top, stk[N], fa[N][LogN], mv[N][LogN], vir[N], vn, par[N], vi[N], tm,
yy[N]; ll ans[N]; bool isvir[N];
void add_edge(int u, int v, int w) {
    nxt[++ecnt] = adj[u]; adj[u] = ecnt; go[ecnt] = v; val[ecnt] = w;
    nxt[++ecnt] = adj[v]; adj[v] = ecnt; go[ecnt] = u; val[ecnt] = w;
}
void dfs(int u, int fu) {
    int i; fa[u][0] = fu; dep[u] = dep[fu] + 1;
    for (i = 0; i <= 19; i++)
        fa[u][i + 1] = fa[fa[u][i]][i],
        mv[u][i + 1] = min(mv[u][i], mv[fa[u][i]][i]);
    dfn[u] = ++times;
    for (int e = adj[u], v; e; e = nxt[e])
        if ((v = go[e]) != fu)
            mv[v][0] = val[e], dfs(v, u);
}
int lca(int u, int v) {
    int i; if (dep[u] < dep[v]) swap(u, v);
    for (i = 20; i >= 0; i--) {
        if (dep[fa[u][i]] >= dep[v]) u = fa[u][i];
        if (u == v) return u;
    }
    for (i = 20; i >= 0; i--)
        if (fa[u][i] != fa[v][i])
            u = fa[u][i], v = fa[v][i];
    return fa[u][0];
}
int dis(int u, int v) {
    int i, ans = INF;
    for (i = 20; i >= 0; i--) {
        if (dep[fa[u][i]] >= dep[v])
            ans = min(ans, mv[u][i]), u = fa[u][i];
        if (u == v) return ans;
    }
    return ans;
}
bool comp(int u, int v) {
    return dfn[u] < dfn[v];
}
void build() {
    int i, tmp = vn; top = 0;
    sort(vir + 1, vir + vn + 1, comp);
    for (i = 1; i <= tmp; i++) {
        int u = vir[i];
        if (!top) {
            par[u] = 0;
            stk[++top] = u;
            continue;
        }
        int w = lca(stk[top], u);
        while (dep[stk[top]] > dep[w]) {
            if (dep[stk[top - 1]] < dep[w]) par[stk[top]] = w;
            top--;
        }
        if (w != stk[top]) {
            vir[++vn] = w;
            par[w] = stk[top];
            stk[++top] = w;
        }
        par[u] = w; stk[++top] = u;
    }
    sort(vir + 1, vir + vn + 1, comp);
}
void DP() {
    int i; for (i = 1; i <= vn; i++) ans[vir[i]] = 0;
    for (i = vn; i >= 2; i--) {
        int u = vir[i];
        if (isvir[u]) ans[par[u]] += 1ll * vi[u];
        else ans[par[u]] += min(1ll * vi[u], ans[u]);
    }
}
ll solve() {
    int i; for (i = 2; i <= vn; i++)
        vi[vir[i]] = dis(vir[i], par[vir[i]]);
    return DP(), ans[1];
}
int main() {
    int i, x, y, z; n = read();
    for (i = 1; i < n; i++) {
        x = read(); y = read(); z = read();
        add_edge(x, y, z);
    }
    dfs(1, 0); m = read(); while (m--) {
        vn = read() + 1; vir[1] = 1; tm = vn - 1;
        for (i = 2; i <= vn; i++) vir[i] = yy[i - 1] = read(),
            isvir[vir[i]] = 1; build();
        printf("%lld\n", solve());
        for (i = 1; i <= tm; i++) isvir[yy[i]] = 0;
    }
    return 0;
}