树形DP 洛谷P2014

题目~

跟那道苹果树 一样
做得多了就有了更深的理解

//MADE BY Y_is_sunshine;
//#include <bits/stdc++.h>
//#include <memory.h>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <cstdio>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <math.h>

#define INF 0x3f3f3f3f
#define MAXN 305

const int mod = 1e9 + 7;

using namespace std;

struct node {
	int to;
	int next;
}edge[MAXN << 1];

int N, M;
int cnt;

int dp[MAXN][MAXN];
int sz[MAXN];
int from[MAXN];
int price[MAXN];

void add(int u, int v) {
	edge[++cnt].next = from[u];
	edge[cnt].to = v;
	from[u] = cnt;
}

void dfs(int u, int fa) {
	//sz[u] = 1;
	for (int i = from[u]; i; i = edge[i].next) {
		int v = edge[i].to;
		if (fa == v)
			continue;
		dfs(v, u);
		sz[u] += sz[v] + 1;
		for (int j = min(sz[u], M); j >= 0; j--) {
			for (int k = min(j - 1, sz[v]); ~k; k--)
				dp[u][j] = max(dp[u][j], dp[v][k] + dp[u][j - k - 1] + price[v]);
		}
	}
}

int main()
{
	freopen("data.txt", "r", stdin);

	cin >> N >> M;
	for (int i = 1; i <= N; i++) {
		int a, b;
		scanf("%d%d", &a, &b);
		add(a, i);
		price[i] = b;
	}
	
	dfs(0, -1);

	cout << dp[0][M] << endl;


	freopen("CON", "r", stdin);
	system("pause");
	return 0;
}