HDU 1561（The more, The Better）

#include <iostream>
#include <algorithm>
using namespace std;
const int MAXN = 205;

struct Edge //边
{
    int to; //到达结点
    int next; //出发结点的下一条边的编号
}edge[MAXN];

int dp[MAXN][MAXN]; //动态规划数组
int head[MAXN]; //head[i]表示从结点i出发的第1条边的编号
int val[MAXN]; //结点的价值
int total; //边的总数

//添加结点u到结点v的边
void addEdge(int u, int v)
{
    edge[++total].to = v;
    edge[total].next = head[u];
    head[u] = total;
}

//深搜，搜索以结点u为根结点，选取num个结点的最大价值
void DFS(int u, int num)
{
    if (num <= 0) 
        return;

    for (int i = head[u]; i != -1; i = edge[i].next)
    {
        int v = edge[i].to;
        DFS(v, num - 1);
        for (int j = num; j > 1; j--)
        {
            for (int k = 1; k <= num - 1; k++)
            {
                if (j > k)
                    dp[u][j] = max(dp[u][j], dp[u][j - k] + dp[v][k]);
            }
        }
    }
}

int main()
{
    int N, M;
    while (cin >> N >> M)
    {
        if (N == 0 && M == 0)
            break;

        memset(dp, -1, sizeof(dp));
        memset(head, -1, sizeof(head));
        total = 0;

        int a, b;
        for (int i = 1; i <= N; i++)
        {
            cin >> a >> b;
            addEdge(a, i);
            val[i] = b;
            dp[i][1] = val[i];
        }

        dp[0][1] = 0; //令整棵树的根结点编号为0，价值为0
        ++M;
        DFS(0, M);
        cout << dp[0][M] << endl;
    }
    return 0;
}