01背包
每种物品只能取一件,拿或者不拿
#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 1000 + 10;
int dp[maxn];
int n,V;
int v[maxn],w[maxn]; //体积和权重
int solve(){
memset(dp,0,sizeof dp);
for(int i = 1;i <= n; i++){ //从1开始,因为已经确定i=0时,dp=0
for(int j = V; j >= 0; j--){ //体积递减
if(j<v[i]) //背包容量不足,则不取
dp[j] = dp[j];
else
dp[j] = max(dp[j], dp[j-v[i]]+w[i]);
}
}
return dp[V];
}
int main()
{
cin>>n>>V;
for(int i = 1;i <= n;i++)
cin>>v[i]>>w[i];
cout<<solve()<<endl;
return 0;
}
完全背包
每种物品都有无限件可用
只需对01背包
体积递减改为体积递增即可
#include<iostream>
#include<cstring>
using namespace std;
const int maxn = 1000 + 10;
int dp[maxn];
int n,V;
int v[maxn],w[maxn]; //体积和权重
int solve(){
memset(dp,0,sizeof dp);
for(int i = 1;i <= n; i++){ //从1开始,因为已经确定i=0时,dp=0
for(int j = 0; j <= V; j++){ //体积递增
if(j<v[i]) //背包容量不足,则不取
dp[j] = dp[j];
else
dp[j] = max(dp[j], dp[j-v[i]]+w[i]);
}
}
return dp[V];
}
int main()
{
cin>>n>>V;
for(int i = 1;i <= n;i++)
cin>>v[i]>>w[i];
cout<<solve()<<endl;
return 0;
}