hdu 1561简易树形DP

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

const int maxn = 205;
int n, m, val[maxn];
int dp[maxn][maxn];
int head[maxn], tol;
struct Edge
{
	int v, next;
}edge[maxn];

void init()
{
	memset(dp, 0, sizeof(dp));
	memset(head, -1, sizeof(head));
	tol = 0;
	memset(dp, 0, sizeof(dp));
}

void addedge(int u, int v)
{
	edge[tol].next = head[u];
	edge[tol].v = v;
	head[u] = tol++;
}

void dfs(int u)
{
	dp[u][1] = val[u];
	for (int i = head[u]; i != -1; i = edge[i].next)
	{
		int v = edge[i].v;
		dfs(v);
		for (int j = m - 1; j >= 1; j--)
		{
			for (int k = 1; k + j <= m; k++)
			{
				dp[u][j + k] = max(dp[u][j + k], dp[u][j] + dp[v][k]);
			}
		}
	}
}

int main()
{
	while (scanf("%d%d", &n, &m) && n + m)
	{
		m++;
		init();
		for (int v = 1; v <= n; v++)
		{
			int u;
			scanf("%d%d", &u, &val[v]);
			addedge(u, v);
		}
		dfs(0);
		printf("%d\n", dp[0][m]);
	}
	return 0;
}