【树形DP】【多叉转二叉】【poj 1947】Rebuilding Roads

http://poj.org/problem?id=1947

对多叉转二叉不是很熟悉，参考了下别人的代码，写得很好

//#define _TEST _TEST
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
/************************************************
Code By willinglive    Blog:http://willinglive.cf
************************************************/
#define rep(i,l,r) for(int i=(l),___t=(r);i<=___t;i++)
#define per(i,r,l) for(int i=(r),___t=(l);i>=___t;i--)
#define MS(arr,x) memset(arr,x,sizeof(arr))
#define LL long long
#define INE(i,u,e) for(int i=head[u];~i;i=e[i].next)
inline const int read()
{int r=0,k=1;char c=getchar();for(;c<'0'||c>'9';c=getchar())if(c=='-')k=-1;
for(;c>='0'&&c<='9';c=getchar())r=r*10+c-'0';return k*r;}
/
int n,p;
int dp[155][155];
int son[155],fa[155],brother[155],root;
/
inline void MIN(int &a,int b){if(a>b)a=b;}
void dfs(int u)
{
	MS(dp[u],1);
	dp[u][1]=0;
    int v=son[u];
    while(v)
    {
    	dfs(v);
    	per(i,p,1)
    	{
    		int tmp=dp[u][i]+1; //不划分 
    		rep(j,1,i-1) //从v中划分出j个
    		   MIN(tmp,dp[v][i-j]+dp[u][j]); 
    		dp[u][i]=tmp;
    	}
    	v=brother[v];
    }
	
}
/
void input()
{
	scanf("%d%d",&n,&p);
	int u,v;
	rep(i,1,n-1)
	{
		scanf("%d%d",&u,&v);
		fa[v]=1;
		brother[v]=son[u];
		son[u]=v;
	}
	rep(i,1,n) if(!fa[i]) {root=i;break;}
}
void solve()
{
	dfs(root);
	int ans=dp[root][p];
	rep(i,1,n) MIN(ans,dp[i][p]+1);
	printf("%d\n",ans);
}
/
int main()
{
    #ifndef _TEST
    freopen("std.in","r",stdin); freopen("std.out","w",stdout);
    #endif
    input(),solve();
    return 0;
}