BUN 4183

http://acm.bnu.edu.cn/bnuoj/problem_show.php?pid=4183

初学 0/1 背包，准备开始看背包.....

#include <iostream>
#define maxn 1001
using namespace std;
int f[maxn][maxn], v[maxn], w[maxn], mark[maxn];
int main()
{
    int i, j, n, m, l, now;
    cin >> n >> m;
    for(i = 0; i <= n; i++)
     for(j = 0; j <= m; j++)
        f[i][j] = 0;
    for(i = 1; i <= n; i++)
        cin >> v[i] >> w[i];
    l = 0;    
    for(i = 1; i <= n; i++)
    {
        for(j = 0; j <= m; j++)
        {
            f[i][j] = f[i-1][j];
            if( v[i] <= j && f[i-1][j-v[i]]+w[i] > f[i][j])
              f[i][j] = f[i-1][j-v[i]]+w[i];
        }
    }
    j = m;
    for(i = n; i >= 1; i--)
    {
        if(f[i][j] > f[i-1][j])
        {
            mark[l++] = i;
            j -= v[i];
        }
    }
    cout << f[n][m] << endl;
     for(i = 0; i < l; i++)
    {
        if(i == l-1) cout << mark[i]-1 << endl;
        else cout << mark[i]-1 << " ";
    }
    return 0;
}