0-1背包问题
-
有五个物品,装入容量为固定值的背包,求出最大的价值
-
代码中每个物品的重量和价值可以按需要更改
-
同博主的其他博客一样,代码会给出每一步操作的详情(一层层的输出)
#include <iostream>
using namespace std;
void initialization(int w[6],int v[6]){ //初始化w和v数组
w[0] = 0;
w[1] = 2;
w[2] = 2;
w[3] = 6;
w[4] = 5;
w[5] = 4;
v[0] = 0;
v[1] = 6;
v[2] = 3;
v[3] = 5;
v[4] = 4;
v[5] = 6;
}
void getNum0Column(int V[6][11]){ //初始化第0行和第0列
for (int i = 0; i < 6; ++i) { //初始化第0列
V[i][0] = 0;
}
for (int j = 0; j < 11; ++j) {
V[0][j] = 0;
}
}
void calculate(int w[6],int v[6],int V[6][11]){ //填表
for (int i = 1; i < 6; ++i) {
for (int j = 1; j < 11; ++j) {
if (j<w[i]){
V[i][j]=V[i-1][j];
}else{
V[i][j] = max(V[i-1][j], V[i-1][j-w[i]]+v[i]);
}
}
for (int k = 0; k < 6; ++k) {
for (int j = 0; j < 11; ++j) {
cout.setf(ios::left);
cout.width(2);
cout<<V[k][j]<<" ";
}
cout<<endl;
}
cout<<"================================"<<endl;
}
cout<<"最大价值为:"<<V[5][10]<<endl;
}
void print(int V[6][11],int w[6],int v[6]){ //确定装入了哪些物品并输出
int x[6];//记录是否装入
int j = 10; //总容量为10
for (int i = 5; i > 0; --i) {
if (V[i][j]>V[i-1][j]) {
x[i]=1;
j=j-w[i];
}
else x[i]=0;
}
cout<<"装入的物品有:"<<endl;
for (int k = 1; k < 6; ++k) {
if(x[k]==1){
cout<<"第"<<k<<"件物品("<<"weight:"<<w[k]<<",value:"<<v[k]<<")"<<endl;
}
}
}
int main() {
int w[8]; //所占容量
int v[8]; //对应价值
initialization(w,v); //初始化w和v数组
int V[6][11] = {0}; //最大价值表
getNum0Column(V); //初始化第0列和第0列
calculate(w,v,V); //开始填表计算并输出最大值
print(V,w,v);//输出装入了哪些东西
}
- 输出结果
0 0 0 0 0 0 0 0 0 0 0
0 0 6 6 6 6 6 6 6 6 6
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
================================
0 0 0 0 0 0 0 0 0 0 0
0 0 6 6 6 6 6 6 6 6 6
0 0 6 6 9 9 9 9 9 9 9
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
================================
0 0 0 0 0 0 0 0 0 0 0
0 0 6 6 6 6 6 6 6 6 6
0 0 6 6 9 9 9 9 9 9 9
0 0 6 6 9 9 9 9 11 11 14
0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0
================================
0 0 0 0 0 0 0 0 0 0 0
0 0 6 6 6 6 6 6 6 6 6
0 0 6 6 9 9 9 9 9 9 9
0 0 6 6 9 9 9 9 11 11 14
0 0 6 6 9 9 9 10 11 13 14
0 0 0 0 0 0 0 0 0 0 0
================================
0 0 0 0 0 0 0 0 0 0 0
0 0 6 6 6 6 6 6 6 6 6
0 0 6 6 9 9 9 9 9 9 9
0 0 6 6 9 9 9 9 11 11 14
0 0 6 6 9 9 9 10 11 13 14
0 0 6 6 9 9 12 12 15 15 15
================================
最大价值为:15
装入的物品有:
第1件物品(weight:2,value:6)
第2件物品(weight:2,value:3)
第5件物品(weight:4,value:6)