概述:给出一组产品的价值和体积以及包的容量,求包能装的产品的最大价值。
思路:与1019题类同,同为01背包问题。状态方程为 dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
感想:这套题里有好多01背包啊。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int MAX = 1005;
int w[MAX];
int v[MAX];
int dp[MAX];
int main()
{
int t, n, m;
scanf("%d", &t);
while (t--)
{
memset(w, 0, sizeof(w));
memset(v, 0, sizeof(v));
memset(dp, 0, sizeof(dp));
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &v[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &w[i]);
for (int i = 1; i <= n; i++)
{
for (int j = m; j >= 0; j--)
{
if (j >= w[i])
dp[j] = max(dp[j], dp[j - w[i]] + v[i]);
}
}
printf("%d\n", dp[m]);
}
return 0;
}