@[lucy2012](/user/1252442) 可能你可以从以前都没选过转移,所以是for(int j=0;j<=t;j++)
by lutaoquan2012 @ 2024-04-26 18:35:36
@[lucy2012](/user/1252442) 刚才回答的不是主要问题,你的转移有问题,他是从上一次转移过来的,所以是dp[i][j]=max(dp[i-1][j],dp[i-1][j-v[i]]+w[i]);
by lutaoquan2012 @ 2024-04-26 18:38:48
@[lutaoquan2012](/user/952033) 这个是什么意思捏?
by lucy2012 @ 2024-04-26 18:39:00
@[lutaoquan2012](/user/952033) 抱歉,看晚了
by lucy2012 @ 2024-04-26 18:39:41
@[lutaoquan2012](/user/952033) 就是上一个是什么意思?
by lucy2012 @ 2024-04-26 18:40:20
@[lutaoquan2012](/user/952033) 谢啦!
by lucy2012 @ 2024-04-26 18:41:41
@[lucy2012](/user/1252442) 就是从上一个物品转移过来
by lutaoquan2012 @ 2024-04-26 18:41:57
@[lutaoquan2012](/user/952033) ?
by lucy2012 @ 2024-04-26 19:44:34
@[lutaoquan2012](/user/952033) 我好像几个月前就给了欸QwQ抱歉啦
by lucy2012 @ 2024-04-26 19:45:11
@[lucy2012](/user/1252442) 抱歉抱歉
by lutaoquan2012 @ 2024-04-26 19:46:28