for (int i=0; i<N; i++) { for (int j=v[i]; j<=V; j++) { if (i == 0) { dp[i][j] = w[i]; } else { dp[i][j] = max(dp[i-1][j], dp[i-1][j-v[i]] + w[i]); } } }
2. 背包必须被装满
for (int i=0; i<N; i++) { for (int j=v[i]; j<=V; j++) { if (i == 0) { if (j == v[i]) { dp[i][j] = w[i]; } } else { if (j == v[i]) { dp[i][j] = max(dp[i-1][j], w[i]); } else { if (dp[i-1][j-v[i]] > 0) { dp[i][j] = max(dp[i-1][j], dp[i-1][j-v[i]] + w[i]); } else { dp[i][j] = dp[i-1][j]; } } } } }
原文:https://www.cnblogs.com/xumaomao/p/15017332.html