基于动态规划的0-1背包问题

C++实现基于动态规划的0-1背包问题

#include<iostream>

#include<iomanip>

using namespace std;

const int MAX = 1000;

int w[MAX], v[MAX], best[MAX];

int V[MAX][MAX];  //最大价值矩阵

int W, n; //W为背包的最大载重量，n为物品的数量

//求最大值函数

int max(int x, int y)

{

return x >= y ? x : y;

}

//求最小值函数

int min(int x, int y)

{

return x >= y ? y : x;

}

void Knaspack()

{

int Max = min(w[n] - 1, W);

for (int j = 1; j <= Max; j++)

V[n][j] = 0;

for (int j = w[n]; j <= W; j++)

V[n][j] = v[n];

for (int i = n - 1; i > 1; i--)

{

Max = min(w[i] - 1, W);

for (int j = 1; j <= Max; j++)

V[i][j] = V[i + 1][j];

for (int j = w[i]; j <= W; j++)

V[i][j] = max(V[i + 1][j], V[i + 1][j - w[i]] + v[i]);

}

V[1][W] = V[2][W]; //先假设第一个物品不放入

if (W > w[1])

V[1][W] = max(V[1][W], V[2][W - w[1]] + v[1]);

}

//生成向量数组，决定某一个物品是否应该放入背包

void Traceback()

{

for (int i = 1; i < n; i++)   //比较矩阵两邻两行(除最后一行)，背包容量为W的最优值.

{

if (V[i][W] == V[i + 1][W])  //如果当前行的最优值与下一行的最优值相等，则表明该物品不能放入。

best[i] = 0;

else          //否则可以放入

{

best[i] = 1;

W -= w[i];

}

}

best[n] = (V[n][W]) ? 1 : 0;

}

void main()

{

int k = 2;

while (1)

{

n = 0;

W = 0;

cout << endl;

cout << "  输入商品数量n:";

cin >> n;

cout << endl;

cout << "  输入背包容量W:";

cin >> W;

cout << endl;

cout << "  输入每件商品的重量w" << endl;

for (int i = 1; i <= n; i++)

{

cout << "      第" << i << "个物品的重量：";

cin >> w[i];

cout << endl;

}

memset(V, 0, sizeof(V));

cout << "  输入每件商品的价值v" << endl;

for (int i = 1; i <= n; i++)

{

cout << "      第" << i << "个物品的价值：";

cin >> v[i];

cout << endl;

}

Knaspack();//构造矩阵

Traceback(); //求出解的向量数组

int totalW = 0;

int totalV = 0;

//显示可以放入的物品

cout << "  所选择的商品如下" << endl;

cout << " 序号i  重量w    价格v " << endl;

for (int i = 1; i <= n; i++)

{

if (best[i] == 1)

{

totalW += w[i];

totalV += v[i];

cout << setiosflags(ios::left) << setw(5) << i << "   " << w[i] << "   " << v[i] << endl;

}

}

cout << "  重量总和是:" << totalW;

cout<< "  价值最优解是:"<< totalV << endl;

cout << "        1.重新开始" << "     2.退出" << endl;

cout << "    请选择 1 或者 2 ：";

cin >> k;

cout << endl;

if (k == 1)

{

continue;

}

else

{

break;

}

}

}