AcWing 3. 完全背包问题【背包问题】【动态规划】

---

一、题目链接

AcWing 3. 完全背包问题

---

二、题目分析

（一）算法标签

背包问题 DP

（二）解题思路

---

三、AC代码

解法一:（时间复杂度：$O(nms)=O(n^3)$）TLE

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

using namespace std;

const int N = 1010;

int n, m;
int v[N], w[N];
// f[i][j]表示从前i个物品中选，体积不超过j的最大价值
// 集合划分：第i个物品选k(k=0,1,2...)个，但满足限制条件k*v[i]<=j
int f[N][N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ )
        scanf("%d%d", &v[i], &w[i]);
    for (int i = 1; i <= n; i ++ )
        for (int j = 0; 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;
}

解法二（二维，时间复杂度：$O(n^2)$）AC

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

using namespace std;

const int N = 1010;

int n, m;
int v[N], w[N];
// f[i][j]表示从前i个物品中选，体积不超过j的最大价值
// 集合划分：第i个物品选k(k=0,1,2...)个，但满足限制条件k*v[i]<=j
int f[N][N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ )
        scanf("%d%d", &v[i], &w[i]);
    for (int i = 1; i <= n; i ++ )
        for (int j = 0; j <= m; j ++ )
        {
            // 不选第i件物品
            f[i][j] = f[i - 1][j];
            // 选第i件物品
            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;
}

解法三（一维，时间复杂度：$O(n^2)$）AC

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

using namespace std;

const int N = 1010;

int n, m;
int v[N], w[N];
// f[j]表示体积不超过j的最大价值
int f[N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ )
        scanf("%d%d", &v[i], &w[i]);
    for (int i = 1; i <= n; i ++ )
        for (int j = v[i]; j <= m; j ++ )
            f[j] = max(f[j], f[j - v[i]] + w[i]);
    cout << f[m] << endl;
    return 0;
}

---

四、其它题解

AcWing 3. 完全背包问题