题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4772
容易想到用dp[x][t]表示一开始位于x节点且拥有t天的时间最多能获得多少treasure,并保证第t天我们回到x这个起点,接着怎么dp呢,对于和x相距d的子节点y,我们有:
如果2d > t,即从x出发不能在截止时间前返回,则我们不能选择去y;
否则,我们可以选择去以y为根的子树,并且待上0 <= k <= t - 2d天,从而dp[x][t] = max(dp[x][t], dp[x][t-2d-k] + dp[y][k])
做的时候WA了一次,因为进入dfs初始化的时候,直接让dp[x][*] = treasure[x]再dp,这样实际上对于上面的状态转移方程来说,treasure[x]可能就加了不止一次了,因此需要在每个节点状态转移完成之后再加上自身的值
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int MAX_N = 101;
const int MAX_T = 201;
int N, R, T;
int val[MAX_N];
int len[MAX_N][MAX_T];
vector<int> neighbour[MAX_N];
int dp[MAX_N][MAX_T];
bool input()
{
if(1 != scanf("%d", &N)) return false;
int i, x, y, d;
for(i = 1; i <= N; ++i){
scanf("%d", val + i);
neighbour[i].clear();
}
for(i = 1; i < N; ++i){
scanf("%d%d%d", &x, &y, &d);
len[x][y] = len[y][x] = d;
neighbour[x].push_back(y);
neighbour[y].push_back(x);
}
scanf("%d%d", &R, &T);
return true;
}
void dfs(int x, int fa)
{
//initialize
memset(dp[x], 0, sizeof(dp[x]));
//divide and conquer
const vector<int>& v = neighbour[x];
if(x == R || v.size() > 1){
for(int i = v.size()-1; i > -1; --i){
int y = v[i];
if(y == fa) continue;
dfs(y, x);
for(int t = T, d = len[x][y] << 1; t >= d; --t){
int tmp = dp[x][t];
for(int k = 0; k + d <= t; ++k){
tmp = max(tmp, dp[y][k] + dp[x][t-d-k]);
}
dp[x][t] = tmp;
}
}
}
//add self value here to eliminate repeated adding
for(int i = 0; i <= T; ++i) dp[x][i] += val[x];
}
int main()
{
while(input()){
dfs(R, -1);
printf("%d\n", dp[R][T]);
}
return 0;
}