有依赖的背包问题（树形 dp）——模板

代码

#include <bits/stdc++.h>
using namespace std;
#define db  double
#define ll  long long
#define Pir pair<int, int>
#define fi  first
#define se  second
#define pb  push_back
#define m_p make_pair
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
/*==========ACMer===========*/
const int N = 105;
int f[N][N];
int n, m, p, root;
int v[N], w[N];
vector<int> e[N];

void dfs(int x)
{
    for (int i = v[x]; i <= m; i ++) f[x][i] = w[x];
    for (auto y : e[x]) {
        dfs(y);
        for (int i = m; i >= v[x]; i --) {
            for (int j = 0; j <= i - v[x]; j ++) {
                f[x][i] = max(f[x][i], f[x][i - j] + f[y][j]);
            }
        }
    }
}

int main()
{
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i ++) {
        scanf("%d %d %d", &v[i], &w[i], &p);
        if (p == -1) root = i;
        else {
            e[p].pb(i);
        }
    }

    dfs(root);
    printf("%d\n", f[root][m]);

    return 0;
}