POJ1947 Rebuilding Roads(树状DP)

                                                                          Rebuilding Roads

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 3698		Accepted: 1517

Description

The cows have reconstructed Farmer John's farm, with its N barns (1 <= N <= 150, number 1..N) after the terrible earthquake last May. The cows didn't have time to rebuild any extra roads, so now there is exactly one way to get from any given barn to any other barn. Thus, the farm transportation system can be represented as a tree.

Farmer John wants to know how much damage another earthquake could do. He wants to know the minimum number of roads whose destruction would isolate a subtree of exactly P (1 <= P <= N) barns from the rest of the barns.

Input

* Line 1: Two integers, N and P

* Lines 2..N: N-1 lines, each with two integers I and J. Node I is node J's parent in the tree of roads.

Output

A single line containing the integer that is the minimum number of roads that need to be destroyed for a subtree of P nodes to be isolated.

Sample Input

11 6
1 2
1 3
1 4
1 5
2 6
2 7
2 8
4 9
4 10
4 11

Sample Output

2

这题是我的第二个树状DP，还是看着一个大牛的代码写的。还是要更加努力呀，努力    加油。。。。。。

每个节点都有两种不同的状态：

1.该点被包含在剩下的树，其子树则不被包含

2.该点不被包含在剩下的树，其子树判断和该点一样。

dp[i,j]表示节点i为根节点得到剩下j个节点的树所删边的最小数目

#include<iostream>
#include<vector>
#define MAX 999999999
using namespace std;
int n,m,dp[151][151],s[151],root;
vector<int>v[151];
void dfs(int t)
{
    int i,j,k=0;
    //if(t==root)  dp[t][1]=v[t].size();
    if(t!=root) dp[t][1]=v[t].size()+1;
    //if(dp[t][t1]<MAX)  return dp[t][t1];
    for(i=0;i<v[t].size();i++)
    {
         dfs(v[t][i]);
         for(j=m-1;j>=1;j--)
             if(dp[t][j]<MAX)
                  for(k=1;j+k<=m;k++)
                       if(dp[t][k]<MAX)
                            dp[t][j+k]=min(dp[t][j+k],dp[t][j]+dp[v[t][i]][k]-2);
    }
}
int main()
{
    int i,j,x,y;
    while(cin>>n>>m)
    {
        for(i=1;i<=n;i++)
        {
            v[i].clear();
            s[i]=0;
        }
        for(i=1;i<n;i++)
        {
            cin>>x>>y;
            v[x].push_back(y);
            s[y]=1;
        }
        for(i=1;i<=n;i++)
             for(j=1;j<=m;j++)
                  dp[i][j]=MAX;
        for(i=1;i<=n;i++)
            if(!s[i]) 
            {
                root=i;dp[root][1]=v[root].size();dfs(i);break;
            }
        int ans=MAX;
        for(i=1;i<=n;i++)
            ans=min(ans,dp[i][m]);
        cout<<ans<<endl;
    }
    return 0;
}