简单的背包——01背包(2)
题目来源:洛谷 P2871 [USACO07DEC]Charm Bracelet S
共十个测试点
题解
WA代码1:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3500;
int w[maxn], d[maxn];
int dp[maxn][13000];
int n, m;
int main()
{
memset(dp, 0, sizeof(dp));
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &w[i], &d[i]);
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= m; ++j)
{
if (w[i] > j)
dp[i][j] = dp[i - 1][j];
else
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w[i]] + d[i]);
}
}
printf("%d", dp[n][m]);
return 0;
}
错误分析:
内存较小,用二维数组会爆内存
测试点通过情况:
#1 ~ #10 MLE
WA代码2:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3500;
int w[maxn], d[maxn];
int n, m;
int dp[13000];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
{
scanf("%d%d", &w[i], &d[i]);
for (int j = 1; j <= m; ++j)
{
if (w[i] <= j)
dp[j] = max(dp[j - w[i]] + d[i], dp[j]);
}
}
printf("%d", dp[m]);
return 0;
}
错误分析:
dp 具有后效性,从二维数组改为一维数组后需要考虑顺序;
15 行代码要反过来
测试点通过情况:
#1,#2,#4~#10 WA
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3500;
int w[maxn], d[maxn];
int n, m;
int dp[13000];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i)
{
scanf("%d%d", &w[i], &d[i]);
// m ~ 1 消除后效性
for (int j = m; j >= 1; --j)
{
if (w[i] <= j)
dp[j] = max(dp[j - w[i]] + d[i], dp[j]);
}
}
printf("%d", dp[m]);
return 0;
}