poj 1947 Rebuilding Roads 树形dp背包

dp[i][j] 代表以i为根 大小为j需要拆的最小边数
然后dp 注意边界处理对于每个子节点x不连的话dp[i][j] + 1连得话就是 dp[i][j - k] + dp[x][k];
然后除了根节点最后计算结果都要加1因为还要把跟父节点相关的边拆掉

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#define maxi 2333333
using namespace std;
int dp[200][200], n, m;
int last[200 * 2], Next[200 * 2], edge[200 * 2], l = 0;
void add(int a, int b)
{
      edge[l] = b;
      Next[l] = last[a];
      last[a] = l;
      l++;
}
void dfs(int pre, int fa)
{
     dp[pre][1] = 0;
     int sum = 0;
     for(int i = last[pre]; i != -1; i = Next[i])
         if(edge[i] != fa)
         {
            dfs(edge[i], pre);
            for(int j = m; j >= 1; j--)
            {
                dp[pre][j]++;
                for(int k = j - 1; k >= 1; k--)
                    dp[pre][j] = min(dp[pre][j], dp[edge[i]][k] + dp[pre][j - k]);
            }
         }
}
int main()
{
    scanf("%d %d", &n, &m);
    l = 0;
    memset(last, -1, sizeof(last));
    for(int i = 0; i <= n; i++)
        for(int j = 0; j <= n; j++) dp[i][j] = maxi;
    for(int i = 1; i < n; i++)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        add(a, b);
        add(b, a);
    }
    dfs(1, 0);
    int ans = maxi;
    if(dp[1][m] < ans) ans = dp[1][m];
    for(int i = 2; i<= n; i++) if(dp[i][m] + 1 < ans) ans = dp[i][m] + 1;
    printf("%d\n", ans);
    return 0;
}