01背包:
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e4+10;
int f[N][N];
int v[N],w[N];
int main ()
{
int N,M;
cin>>N>>M;
for (int i=1;i<=N;i++)
{
cin>>v[i]>>w[i];
}
f[0][0]=0;
for (int i=1;i<=N;i++)
{
for (int j=1;j<=M;j++)
{
if (j<v[i])
{
f[i][j]=f[i-1][j];
}
else
{
f[i][j]=max(f[i-1][j],f[i-1][j-v[i]]+w[i]);
}
}
}
cout<<f[N][M]<<endl;
return 0;
}
完全背包问题:
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e4+10;
int v[N],w[N];
int f[N][N];
int main ()
{
int n,m;
cin>>n>>m;
for (int i=1;i<=n;i++)
{
cin>>v[i]>>w[i];
}
for (int i=1;i<=n;i++)
{
for (int j=0;j<=m;j++)
{
f[i][j]=f[i-1][j];
if (j>=v[i])
f[i][j]=max(f[i][j],f[i][j-v[i]]+w[i]);
}
}
cout<<f[n][m]<<endl;
return 0;
}