POJ 2486 Apple Tree

Apple Tree

Time Limit: 1000ms

Memory Limit: 65536KB

This problem will be judged on PKU. Original ID: 2486
64-bit integer IO format: %lld      Java class name: Main

 

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.

 

Sample Input

2 1 
0 11
1 2
3 2
0 1 2
1 2
1 3

Sample Output

11
2

Source

POJ Contest,Author:magicpig@ZSU

 

解题：树形dp

 

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;
const int maxn = 200;
vector<int>g[maxn];
int dp[maxn][maxn][2],w[maxn],n,K;
void dfs(int u,int fa) {
    for(int i = 0; i <= K; ++i)
       dp[u][i][0] = dp[u][i][1] = w[u];
    for(int i = g[u].size()-1; i >= 0; --i) {
        if(g[u][i] == fa) continue;
        dfs(g[u][i],u);
        for(int j = K; j > 0; --j) {
            for(int k = 1; k <= j; ++k) {
                dp[u][j][1] = max(dp[u][j][1],dp[u][j - k][0] + dp[g[u][i]][k - 1][1]);
                if(k >= 2) {
                    dp[u][j][1] = max(dp[u][j][1],dp[u][j-k][1] + dp[g[u][i]][k-2][0]);
                    dp[u][j][0] = max(dp[u][j][0],dp[u][j - k][0] + dp[g[u][i]][k - 2][0]);
                }
            }
        }
    }
}
int main() {
    int u,v;
    while(~scanf("%d%d",&n,&K)) {
        for(int i = 1; i <= n; ++i) scanf("%d",w+i);
        for(int i = 0; i < maxn; ++i) g[i].clear();
        for(int i = 1; i < n; ++i) {
            scanf("%d%d",&u,&v);
            g[u].push_back(v);
            g[v].push_back(u);
        }
        memset(dp,0,sizeof dp);
        dfs(1,-1);
        printf("%d
",max(dp[1][K][0],dp[1][K][1]));
    }
    return 0;
}