01背包问题

#include<iostream>
using namespace std;
#define  V 1500
unsigned int f[10][V];//全局变量,自动初始化为0
unsigned int weight[10];
unsigned int value[10];
#define  max(x,y)   (x)>(y)?(x):(y)
int main()
{

int N,M;
cin>>N;//物品个数
cin>>M;//背包容量
for (int i=1;i<=N; i++)
{
cin>>weight[i]>>value[i];
}

for (int i=1; i<=N; i++)
for (int j=1; j<=M; j++){
if (weight[i]<=j){
//可以放的下,取放下和不放下时的最大值
f[i][j]=max(f[i-1][j],f[i-1][j-weight[i]]+value[i]);
}else{
//放不下
f[i][j]=f[i-1][j];
}
}

for(int i=1; i<7; i++){
for(int j=1; j<11; j++){
printf("%2d ",f[i][j]);
}
cout<<endl;
}

cout<<f
[M]<<endl;//输出最大价值

}
/*
6 10
2 3
2 6
1 2
6 5
5 4
4 6
*/

#include<iostream>
using namespace std;
#define  V 1500
unsigned int f[V];//????,??????0
unsigned int weight[10];
unsigned int value[10];
#define  max(x,y)   (x)>(y)?(x):(y)
int main()
{

int N,M;
cin>>N;//物品个数
cin>>M;//背包容量
for (int i=1;i<=N; i++)
{
cin>>weight[i]>>value[i];
}
for (int i=1; i<=N; i++){
for (int j=M; j>=1; j--)
{
if (weight[i]<=j)
{
f[j]=max(f[j],f[j-weight[i]]+value[i]);
}
printf("%2d ", f[j]);
}
cout<<endl;
}

cout<<f[M]<<endl;

}

/*
6 10
2 3
2 6
1 2
6 5
5 4
4 6
*/