dfs 肯定TLE
by 蔡竣凯 @ 2022-03-12 10:24:59
```cpp
for(int i=1;i<=m;i++)
for(int j=n;j>=0;j--)
if(j>=t[i])
dp[j]=max(dp[j-t[i]]+val[i],dp[j]);
```
至于为啥，[别问我](https://www.jianshu.com/p/5218c451c2ca)
by tian_jun_cheng @ 2022-03-12 10:25:21
@[RePon](/user/610147) 不会背包的话建议记忆化
by Zvelig1205 @ 2022-03-12 10:46:31
谢谢大家
by RePon @ 2022-03-13 09:17:48