0-1背包问题及其动态规划求解之二——王晓东的书本解法

#define max(a,b) (((a) > (b)) ? (a) : (b))
#define min(a,b) (((a) < (b)) ? (a) : (b))
template <typename Type>
void Knapsack(Type* v, int *w, int c, int n, Type **m)
{
    //递归初始条件
    int jMax = min(w[n] - 1, c);
    for (int j=0; j<=jMax; j++) {
        m[n][j] = 0;
    }

    for (j=w[n]; j<=c; j++) {
        m[n][j] = v[n];
    }

    //i从2到n-1，分别对j>=wi和0<=j<wi即使m(i,j)
    for (int i=n-1; i>1; i--) {
        jMax = min(w[i] - 1, c);
        for (int j=0; j<=jMax; j++) {
            m[i][j] = m[i+1][j];
        }
        for (j=w[i]; j<=c; j++) {
            m[i][j] = max(m[i+1][j], m[i+1][j-w[i]]+v[i]);
        }
    }

    m[1][c] = m[2][c];
    if (c >= w[1]) {
        m[1][c] = max(m[1][c], m[2][c-w[1]]+v[1]);
    }

}

template <typename Type>
void TraceBack(Type **m, int *w, int c, int n, int* x)
{
    for (int i=1; i<n; i++) {
        if(m[i][c] == m[i+1][c]) x[i] = 0;
        else {
            x[i] = 1;
            c -= w[i];
        }
    }
    x[n] = (m[n][c])? 1:0;
}


int main(int argc, char* argv[])
{
    int n = 5;
    int w[6] = {-1, 2, 2, 6, 5, 4};
    int v[6] = {-1, 6, 3, 5, 4, 6};
    int c = 10;

    int **ppm = new int*[n+1];
    for (int i=0; i<n+1; i++) {
        ppm[i] = new int[c+1];
    }

    int x[6];

    Knapsack<int>(v, w, c, n, ppm);
    TraceBack<int>(ppm, w, c, n, x);

    return 0;
}