1.01背包
倒序枚举
dp[i] = max(dp[i],dp[i - t[i]] + val[i])
2.完全背包
正序枚举
dp[i] = max(dp[i],dp[i - t[i]] + val[i])
1.01背包
倒序枚举
dp[i] = max(dp[i],dp[i - t[i]] + val[i])
2.完全背包
正序枚举
dp[i] = max(dp[i],dp[i - t[i]] + val[i])
转载于:https://www.cnblogs.com/lijilai-oi/p/11490523.html