问题描述:
设U = {u1,u2,u3,......ui}(一共有amount数量的物品)是一组准备放入背包中的物品.设背包的容量为size.
定义每个物品都具有两个属性weight和value.
我们要解决的问题就是计算在所选取的物品总重量不超过背包容量size的前提下使所选的物品总价值最大.
程序的设计:
设V[i, j]用来表示从前i项{u1......ui}中取出来的装入体积为j的背包的最大价值.i的范围是从0到amount,j是从0到size.这样的话要 计算的值就是V[amount, size].V[0, j]对于所有的j的值都是0,因为这时候的包中没有物品.同时V[i, 0]的值也是0,因为没有物品可以放到size为0的背包里面.
所以有:
V[i, j] = 0 若i = 0 或 j = 0;
V[i, j] = V[i - 1, j] 若j < ui.weight;(当物品的重量大于背包承重时,就不把物品放在里面)
V[i, j] = max{V[i - 1, j], V[i - 1, j - ui.weight] + ui.value} 若i > 0并且j >= ui.weight;
现在就可用动态规划的方法运用上面的公式来填表求解了.
#include <stdio.h>
#define W 1000
#define N 1000
typedef struct data
{
int vaule;
int weight;
}goods;
int returnmax(int a, int b)
{
return (a > b ? a : b);
}
int KNAPSACK(goods *P, int a, int s)
{
int V[N][W];
int i,j,mv;
for(i = 0; i < a; i++)
V[i][0] = 0;
for(j = 0; j < s; j++)
V[0][j] = 0;
for(i = 1; i <= a; i++)
for(j = 1; j <= s; j++)
...{
V[i][j] = V[i - 1][j];
if(P[i].weight <= j)
V[i][j] = returnmax(V[i][j],V[i - 1][j - P[i].weight] + P[i].vaule);
}
mv = V[a][s];
return mv;
}
int main()
{
int mostvalue,amount,size,i;
goods A[N];
printf("Input how much the goods have: ");
scanf("%d",&amount);
printf("Input the size of the bag: ");
scanf("%d",&size);
printf("Input the data of the goods: ");
for(i = 0; i < amount; i++)
scanf("%d %d",&A[i].vaule,&A[i].weight);
mostvalue = KNAPSACK(A,amount,size);
printf("%d",mostvalue);
return 0;
}
#define W 1000
#define N 1000
typedef struct data
{
int vaule;
int weight;
}goods;
int returnmax(int a, int b)
{
return (a > b ? a : b);
}
int KNAPSACK(goods *P, int a, int s)
{
int V[N][W];
int i,j,mv;
for(i = 0; i < a; i++)
V[i][0] = 0;
for(j = 0; j < s; j++)
V[0][j] = 0;
for(i = 1; i <= a; i++)
for(j = 1; j <= s; j++)
...{
V[i][j] = V[i - 1][j];
if(P[i].weight <= j)
V[i][j] = returnmax(V[i][j],V[i - 1][j - P[i].weight] + P[i].vaule);
}
mv = V[a][s];
return mv;
}
int main()
{
int mostvalue,amount,size,i;
goods A[N];
printf("Input how much the goods have: ");
scanf("%d",&amount);
printf("Input the size of the bag: ");
scanf("%d",&size);
printf("Input the data of the goods: ");
for(i = 0; i < amount; i++)
scanf("%d %d",&A[i].vaule,&A[i].weight);
mostvalue = KNAPSACK(A,amount,size);
printf("%d",mostvalue);
return 0;
}
代码如下:
#include<iostream>
#define GOODNUM 5
using namespace std;
int main()
{
int good[GOODNUM][2]={{4,6},{5,2},{6,3},{7,7},{8,5}};//good[i][0]:size||good[i][1]:value
int i,j,size,weight;
int v[GOODNUM+1][1000];
cout<<"please input the bag's size"<<endl;
cin>>size;
for(i=0;i<=GOODNUM;i++)
v[i][0]=0;
for(i=0;i<=size;i++)
v[0][i]=0;
for(i=1;i<=GOODNUM;i++)
for(j=1;j<=size;j++){
v[i][j]=v[i-1][j];
if(good[i-1][0]<=j)
if((v[i-1][j-good[i-1][0]]+good[i-1][1])>v[i][j])
v[i][j]=v[i-1][j-good[i-1][0]]+good[i-1][1];
}
cout<<v[GOODNUM][size]<<endl;
}
#define GOODNUM 5
using namespace std;
int main()
{
int good[GOODNUM][2]={{4,6},{5,2},{6,3},{7,7},{8,5}};//good[i][0]:size||good[i][1]:value
int i,j,size,weight;
int v[GOODNUM+1][1000];
cout<<"please input the bag's size"<<endl;
cin>>size;
for(i=0;i<=GOODNUM;i++)
v[i][0]=0;
for(i=0;i<=size;i++)
v[0][i]=0;
for(i=1;i<=GOODNUM;i++)
for(j=1;j<=size;j++){
v[i][j]=v[i-1][j];
if(good[i-1][0]<=j)
if((v[i-1][j-good[i-1][0]]+good[i-1][1])>v[i][j])
v[i][j]=v[i-1][j-good[i-1][0]]+good[i-1][1];
}
cout<<v[GOODNUM][size]<<endl;
}