AcWing 12. 背包问题求具体方案

//f[i][j]=max(f[i-1][j],f[i-1][j-v[i]]+w[i])
#include <iostream>
using namespace std;
const int N = ;
int n, m;
int v[N], w[N];
int f[N][N];
int main() {
    cin >> n >> m;
    for (int i = ; i <= n; i ++ ) cin >> v[i] >> w[i];
    for (int i = n; i >= ; i -- )//最小字典序，从前往后推，那么做dp的时候，从后往前
        for (int j = ; j <= m; j ++ ) {//由于状态是两维的，所以循环顺序无所谓
            f[i][j] = f[i + ][j];
            if (j >= v[i]) f[i][j] = max(f[i][j], f[i + ][j - v[i]] + w[i]);
        }
    //f[1][m]是最大价值
    int j = m;
    for (int i = ; i <= n; i ++ )//依次看每个物品能不能选
            //保证后面大于等于0
        if (j >= v[i] && f[i][j] == f[i + ][j - v[i]] + w[i]) {//只要可以选，就必选
            cout << i << ' ';
            j -= v[i];
        }
    return ;
}