【HDU5290】Bombing Plan（树形DP）

Description

给定一棵树，每个点有一个$w_i$，我们可以选择一些点，使得距离该点小于等于$w_i$的点全部炸掉。问最少选择多少点可以炸掉整棵树。

---

Solution

树形DP。
我们设$f_{u,j}$表示子树$u$可以向外炸掉距离至少为$j$的点的要选择的最少的点。如果$j$为负数，表示还需要向内炸掉距离为$-j$的点。
转移分两种情况：
1. 选择$u$，那么$f_{u,w_u}=1+\sum\limits_{v\in children(u)}f_{v, j}$;
2. 不选择$u$。如果$j< 0$，$f_{u,j}=\sum \limits _{v\in children(u)} \min \limits _{k\ge j + 1}f_{v,k}$；如果$j\ge 0$，$f_{u,j}=\min\limits _{x\in children(u)}f_{x,j+1}\sum\limits_{y\in children(u),x\neq y}f_{y,-j}$
酱紫求出来的是距离恰好为 j j <script type="math/tex" id="MathJax-Element-1848">j</script>的答案，所以最后还求一个后缀最大值即可。

---

Code

/************************************************
 * Au: Hany01
 * Date: Sep 1st, 2018
 * Prob: [HDU5290] Bombing plan
 * Email: hany01dxx@gmail.com & hany01@foxmail.com
 * Inst: Yali High School
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define x first
#define y second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define SZ(a) ((int)(a).size())
#define ALL(a) a.begin(), a.end()
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read() {
    static int _, __; static char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

const int maxn = 1e5 + 5, maxw = 205;

int n, W, beg[maxn], v[maxn << 1], nex[maxn << 1], e, f[maxn][maxw], w[maxn];

inline void add(int uu, int vv) { v[++ e] = vv, nex[e] = beg[uu], beg[uu] = e; }

void DFS(int u, int pa) {
    int le = 1;
    for (register int i = beg[u]; i; i = nex[i])
        if (v[i] != pa) DFS(v[i], u), le = 0;
    if (le) {
        f[u][W + w[u]] = 1, f[u][W - 1] = 0;
        Fordown(i, W - 1, -W) chkmin(f[u][W + i], f[u][W + i + 1]);
        return;
    }
    For(j, -W, -1) {
        f[u][W + j] = 0;
        for (register int i = beg[u]; i; i = nex[i])
            if (v[i] != pa) f[u][W + j] += f[v[i]][W + j + 1];
    }
    For(j, 0, W) {
        register int mn = INF, sm = 0;
        for (register int i = beg[u]; i; i = nex[i])
            if (v[i] != pa) sm += f[v[i]][W - j];
        for (register int i = beg[u]; i; i = nex[i]) if (v[i] != pa)
            chkmin(mn, sm - f[v[i]][W - j] + f[v[i]][W + j + 1]);
        f[u][j + W] = mn;
    }
    int sm = 1;
    for (register int i = beg[u]; i; i = nex[i])
        if (v[i] != pa) sm += f[v[i]][W - w[u]];
    chkmin(f[u][W + w[u]], sm);
    Fordown(i, W - 1, -W) chkmin(f[u][W + i], f[u][W + i + 1]);
}

int main()
{
#ifdef hany01
    freopen("hdu5290.in", "r", stdin);
    freopen("hdu5290.out", "w", stdout);
#endif

    for (static int uu, vv; ~scanf("%d", &n); ) {
        W = 0, Set(beg, 0), e = 1;
        For(i, 1, n) chkmax(W, w[i] = read());
        For(i, 2, n) uu = read(), vv = read(), add(uu, vv), add(vv, uu);
        Set(f, 63), DFS(1, 0), printf("%d\n", f[1][W]);
    }

    return 0;
}