URAL 1018 (金典树形DP)

连接：1018. Binary Apple Tree

Time limit: 1.0 second
Memory limit: 64 MB

Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enumerate by integers the root of binary apple tree, points of branching and the ends of twigs. This way we may distinguish different branches by their ending points. We will assume that root of tree always is numbered by 1 and all numbers used for enumerating are numbered in range from 1 to  N, where  N is the total number of all enumerated points. For instance in the picture below  N is equal to 5. Here is an example of an enumerated tree with four branches:

2 5 \ / 3 4 \ / 1

As you may know it's not convenient to pick an apples from a tree when there are too much of branches. That's why some of them should be removed from a tree. But you are interested in removing branches in the way of minimal loss of apples. So your are given amounts of apples on a branches and amount of branches that should be preserved. Your task is to determine how many apples can remain on a tree after removing of excessive branches.

Input

First line of input contains two numbers:  N and  Q (2 ≤  N ≤ 100; 1 ≤  Q ≤  N − 1).  N denotes the number of enumerated points in a tree.  Q denotes amount of branches that should be preserved. Next N − 1 lines contains descriptions of branches. Each description consists of a three integer numbers divided by spaces. The first two of them define branch by it's ending points. The third number defines the number of apples on this branch. You may assume that no branch contains more than 30000 apples.

Output

Output should contain the only number — amount of apples that can be preserved. And don't forget to preserve tree's root ;-)

Sample

input	output
5 2 1 3 1 1 4 10 2 3 20 3 5 20	21

题目意思： 
有一棵苹果树，苹果树的是一棵二叉树，共N个节点，树节点编号为1~N，编号为1的节点为树根，边可理解为树的分枝，每个分支都长着若干个苹果，现在要要求减去若干个分支，保留M个分支，要求这M个分支的苹果数量最多。

二叉苹果树：一道金典的树形DP，这题很特殊，因为是二叉树，所以只需要处理左二子，右儿子就可以了，但是我还是想着用一般的树形DP来做这道题，就是不当成二叉树来做。

思路：跟0-1背包思想差不多，在u的儿子v为根节点的子树中选j条边加到u中。

dp[u][k]=max(dp[u][k],dp[u][k-j]+dp[v][j-1]+w)(1

#include
#include
const int N=110;
int dp[N][N],vis[N],head[N],num,m;
struct edge
{
	int st,ed,w,next;
}e[N*4];
void addedge(int x,int y,int w)
{
	e[num].st=x;e[num].ed=y;e[num].w=w;e[num].next=head[x];head[x]=num++;
	e[num].st=y;e[num].ed=x;e[num].w=w;e[num].next=head[y];head[y]=num++;
}
void dfs(int u)
{
	vis[u]=1;
	int i,v,w,j,k,son=0;
	for(i=head[u];i!=-1;i=e[i].next)
	{
		v=e[i].ed;w=e[i].w;
		if(vis[v]==1)continue;
		dfs(v);
		for(k=m;k>=1;k--)//0-1背包
		{
		    for(j=1;j<=k;j++)//在v节点的子树中选择j条边
			 if(dp[u][k]