P2014 [CTSC1997] 选课(树上背包)

[CTSC1997] 选课 - 洛谷https://www.luogu.com.cn/problem/P2014

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int n, m;
int f[1005][1005];
int head[MAXN];
int nxt[MAXN];
int cost[MAXN];
int ver[MAXN];
int cnt;

inline void add(int x, int y, int c) {
	ver[++cnt] = y;
	cost[cnt] = c;
	nxt[cnt] = head[x];
	head[x] = cnt;
}

void dp(int now) {
	for (int i = head[now]; i; i = nxt[i]) {
		int v = ver[i];
		//printf("====\n");
		dp(v);
		for (int j = m + 1; j >= 1; j--)	{
			for (int k = 0; k < j; k++) {
				f[now][j] = max(f[now][j], f[v][k] + f[now][j - k]);
			}
		}
	}
}


int main() {
	int v;
	scanf("%d %d", &n, &m);
	for (int i = 1; i <= n; i++) {
		scanf("%d %d", &v, &f[i][1]);
		add(v, i, f[i][1]);
	}
	dp(0);
	printf("%d", f[0][m + 1]);
	return 0;
}