物品无限的背包问题

问题描述：物品无限的背包问题。有n种物品，每种均有无穷多个。第i种物品的体积为Vi，重量 为Wi。选一些物品装到一个容量为C的背包中，使得背包内物品在总体积不超过C的前提下 重量尽量大。1≤n≤100，1≤Vi ≤C≤10000，1≤Wi≤106。

解决思路：与硬币问题一样只是变成了带有权重DAG

只需要将所需要的硬币数量改成物品的价值就行了

#include <iostream>
#include <queue>
#include <functional>
using namespace std;

const int maxn = 100;
int vis[maxn], d[maxn];
int v[maxn], w[maxn];
int n, c;

int dp(int c)
{
    int &ans = d[c];
    if (ans != -1)
        return ans;
    ans = -(1 << 20);
    for (int i = 0; i < n; i++)
    {
        if (c >= v[i])
        {
            ans = max(ans, dp(c - v[i]) + w[i]);
        }
    }
    return ans;
}

int main()
{
    cin >> n>>c;
    for (int i = 0; i < n; i++)
        cin >> v[i] >> w[i];
    memset(d, -1, sizeof(d));
    d[0] = 0;
    cout<<dp(c);
    system("pause");
}

二维数组版本

#include "head.h"
const int maxn = 100;
int n, c;
int v[maxn], w[maxn],f[maxn][maxn];

int main()
{
    cin >> n >> c;
    for (int i = 1; i <= n; i++)
        cin >> v[i];
    for (int j = 1; j <= n; j++)
        cin >> w[j];
    for (int i = 1; i <= n; i++)
    {
        for (int j = v[i]; j <= c; j++)
        {
            f[i][j] = max(f[i][j], f[i][j - v[i]] + w[i]);
        }
    }
    cout << f[n][c] << endl;
    system("pause");
}

一维数组版本

#include "head.h"
const int maxn = 100;
int n, c;
int v[maxn], w[maxn],f[maxn];

int main()
{
    cin >> n >> c;
    for (int i = 1; i <= n; i++)
        cin >> v[i];
    for (int j = 1; j <= n; j++)
        cin >> w[j];
    for (int i = 1; i <= n; i++)
    {
        for (int j = v[i]; j <= c; j++)
        {
            f[j] = max(f[j], f[j - v[i]] + w[i]);
        }
    }
    cout << f[c] << endl;
    system("pause");
}