poj2486 Apple Tree

Description Wshxzt is a lovely girl. She likes apple very much. One
day HX takes her to an apple tree. There are N nodes in the tree. Each
node has an amount of apples. Wshxzt starts her happy trip at one
node. She can eat up all the apples in the nodes she reaches. HX is a
kind guy. He knows that eating too many can make the lovely girl
become fat. So he doesn’t allow Wshxzt to go more than K steps in the
tree. It costs one step when she goes from one node to another
adjacent node. Wshxzt likes apple very much. So she wants to eat as
many as she can. Can you tell how many apples she can eat in at most K
steps.

Input There are several test cases in the input Each test case
contains three parts. The first part is two numbers N K, whose
meanings we have talked about just now. We denote the nodes by 1 2 …
N. Since it is a tree, each node can reach any other in only one
route. (1<=N<=100, 0<=K<=200) The second part contains N integers (All
integers are nonnegative and not bigger than 1000). The ith number is
the amount of apples in Node i. The third part contains N-1 line.
There are two numbers A,B in each line, meaning that Node A and Node B
are adjacent. Input will be ended by the end of file.

Note: Wshxzt starts at Node 1.

Output For each test case, output the maximal numbers of apples Wshxzt
can eat at a line.

如果要求最后必须回到起点的话，状态的表示就变得很简单了。但是要求可以停在任意一点，所以状态表示还要改进。
用dp[i][j][0/1]表示i为根的子树走j步最后回到/没有回到根节点的最大收益，对于u的子节点v，分为【先走别的子树回来】走v再回到u、【先走别的子树回来】走v不回到u、【先走别的子树】走v再回来然后去另一棵子树不回来三种情况进行更新。

#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
int dp[110][210][2],val[110],n,m;
vector<int> to[110];
void dfs(int u,int fa)
{
    int i,j,k,v,p,q,x,y,z;
    for (i=0;i<=m;i++)
      dp[u][i][1]=dp[u][i][0]=val[u];
    for (i=0;i<to[u].size();i++)
      if ((v=to[u][i])!=fa)
      {
        dfs(v,u);
        for (j=m;j;j--)
          for (k=0;k<j;k++)
          {
            if (j-k-2>=0)
            {
                dp[u][j][0]=max(dp[u][j][0],dp[v][k][1]+dp[u][j-k-2][0]);
                dp[u][j][1]=max(dp[u][j][1],dp[v][k][1]+dp[u][j-k-2][1]);
            }
            dp[u][j][0]=max(dp[u][j][0],dp[v][k][0]+dp[u][j-k-1][1]);
            dp[u][j][0]=max(dp[u][j][0],dp[u][j][1]);
          }
      }
}
int main()
{
    int i,j,k,p,q,x,y,z;
    while (scanf("%d%d",&n,&m)==2)
    {
        memset(dp,0,sizeof(dp));
        for (i=1;i<=n;i++)
          to[i].clear();
        for (i=1;i<=n;i++)
          scanf("%d",&val[i]);
        for (i=1;i<n;i++)
        {
            scanf("%d%d",&x,&y);
            to[x].push_back(y);
            to[y].push_back(x);
        }
        dfs(1,-1);
        printf("%d\n",dp[1][m][0]);
    }
}