01背包

例：hnitoj_1490

例：hnitoj_1490


#include <iostream>
#include <cstring>
using namespace std;
int dp[30][80005];
int path[30][80005];
int v[30];
void solve(int k, int cap){
    while(k && cap){
        if(dp[k][cap] == dp[k - 1][cap - v[k]] + v[k]){
            cout << v[k] << ' ';
            cap -= v[k];
        }
        k--;
    }
}

void solve1(int k,int cap){
    while(k&&cap){
        if(path[k][cap]>0){
            cout << v[k] <<' ';
            cap -= v[k];
        }
        k--;
    }
}

int main()
{
    int T, k, cap;
    cin >> T;
    memset(dp, 0, sizeof(dp));
    while(T--){
        int n, m;
        cin >> n >> m;
        v[0] = 0;
        for(k = 1; k <= m; k++)
            cin >> v[k];
        for(k = 1; k <= m; k++){
            for(cap = 1; cap <= n; cap++){
                if(cap < v[k] )
                    dp[k][cap] = dp[k - 1][cap];
                else{
                    dp[k][cap] = max(dp[k - 1][cap], dp[k - 1][cap - v[k]] + v[k]);
                    if(dp[k][cap] == dp[k - 1][cap - v[k]] + v[k])
                                                                                path[k][cap] = 1;
                }
            }
        }
        solve1(m, n);
        cout << endl;
        cout << dp[m][n] << endl;
    }
    return 0;
}

            }
        }
        solve(m, n);
        cout << endl;
        cout << dp[m][n] << endl;
    }
    return 0;
}