完全背包问题

题目链接:https://www.acwing.com/problem/content/3/

朴素做法

#include <iostream>

using namespace std;

const int N = 1010;

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];
    }

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            for(int k = 0; k * v[i] <= j; k++)
            {
                f[i][j] = max(f[i][j],f[i-1][j-k*v[i]]+k*w[i]);
            }
        }
    }

    cout << f[n][m] << endl;
  
    return 0;
}

优化

f[i , j] = max( f[i-1,j] , f[i-1,j-v]+w ,  f[i-1,j-2*v]+2*w , f[i-1,j-3*v]+3*w , .....)
f[i , j - v]= max(         f[i-1,j-v] , f[i-1,j-2*v] + w , f[i-1,j-3*v]+2*w , .....)
由上两式，可得出如下递推关系： 
                        f[i][j]=max(f[i,j-v]+w , f[i-1][j]) 

所以 $k$ 层循环可以丢掉

for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
    f[i][j] = f[i-1][j];
    if(j-v[i] >= 0)
        f[i][j] = max(f[i][j],f[i][j-v[i]]+w[i]);
}

f[i][j] = max(f[i][j],f[i-1][j-v[i]]+w[i]);//01背包
f[i][j] = max(f[i][j],f[i][j-v[i]]+w[i]);//完全背包问题
可以类比01背包，继续使用滚动数组优化

 for(int i = 1; i <= n; i++)
    for(int j = v[i]; j <= m; j++)//这里的j是从小到大枚举，和01背包不一样
    {
            f[j] = max(f[j],f[j-v[i]]+w[i]);
    }

模板

二维数组

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int n,m;
int v[N],w[N];
int dp[N][N];

int main()
{
    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 = 1; j <= m; j++)
        {
            dp[i][j] = dp[i-1][j];
            if(j - v[i] >= 0) dp[i][j] = max(dp[i][j],dp[i][j-v[i]] + w[i]);
        }
    }
    cout << dp[n][m] << endl;
    return 0;
}

一维数组

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int n,m;
int v[N],w[N];
int dp[N];

int main()
{
    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 = v[i]; j <= m; j++)
        {
            dp[j] = max(dp[j],dp[j-v[i]] + w[i]);
        }
    }
    cout << dp[m] << endl;
    return 0;
}