[Hiho 07] Full backpack

Title Description

State F[i, J] indicates that the selection of the first I species has been decided, the total need does not exceed J;

State transition Equation F[i, j] = Max{f[i, j–need[i]] + val[i], f[i–1, j]};

The status of the result is expressed as f[n, M].

Note the difference between the state equation and the 01 backpack, which reflects whether the item can take one or the other.

The difference that is reflected in the code is that the order of the inner loops is different.

#include <iostream> #include <algorithm>using namespace Std;int f[100005];int main () {int n, m;cin >> N & Gt;> M;int val, need;for (int i = 0; i < n; i++) {cin >> need >> val;for (int j = need; J <= m; j + +) {F[j] = max (F[j], F[j-need] + val);}} cout << f[m] << endl;return 0;}

REF: Backpack question nine talk

[Hiho 07] Full backpack