0/1背包问题（二）---动态规划

今天主要讲解一下0/1背包问题利用动态规划算法进行求解，但是有一个问题暂时木有解决，即如何返回选中的物品索引，后续将加以改进，解决这个问题。

#include <iostream>
#include <string>
#include <csetjmp>
using namespace std;
int max(int a, int b){
    return a > b ? a : b;
}
double _01Pack(int w[],double v[],int w_len,int v_len,int pack){
    int **c;
    bool* flags = new bool[w_len];
    c = new int*[w_len+1];
    for (int i = 0; i < w_len + 1; i++){
        c[i] = new int[pack + 1];
    }
    for (int i = 0; i < w_len + 1; i++){
        for (int j = 0; j < pack + 1; j++){
            if (i == 0 || j == 0){
                c[i][j] = 0;
            }
            else{
                if (w[i - 1] <= j){
                    c[i][j] = max(c[i - 1][j - w[i - 1]] + v[i - 1], c[i - 1][j]);
                }
                else{
                    c[i][j] = c[i - 1][j];
                }
            }
        }
    }

    double val = c[w_len][pack];
    for (int i = 0; i < w_len; i++){
        delete[] c[i];
    }
    delete[] c;
    return val;
}
int main(){
    int w[] = { 10, 10, 30, 20, 40 };
    double v[] = {60,200,120,200,200};
    double value = 0.0;
    int pack_len = 0;
    value = _01Pack(w, v, 5, 5, 60);
    cout << value<<endl;
    return 0;
}

运行结果：