题目:
http://acm.hdu.edu.cn/showproblem.php?pid=2602
题意:
给定物品数和背包容量,有n个物品,给出每个物品的体积和价值,问背包最多能装的最大价值是多少
思路:
01背包模板题,不多说了。从头开始学动态规划。。。
二维:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 1010, INF = 0x3f3f3f3f;
int dp[N][N];
int w[N], v[N];
int main()
{
int t, n, m;
scanf("%d", &t);
while(t--)
{
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 = 0; j <= m; j++)
if(j < w[i]) dp[i][j] = dp[i-1][j];
else dp[i][j] = max(dp[i-1][j], dp[i-1][j-w[i]] + v[i]);
printf("%d\n", dp[n][m]);
}
return 0;
}
一维
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
using namespace std;
const int N = 1010, INF = 0x3f3f3f3f;
int dp[N];
int w[N], v[N];
int main()
{
int t, n, m;
scanf("%d", &t);
while(t--)
{
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]);
memset(dp, 0, sizeof dp);
for(int i = 1; i <= n; i++)
for(int j = m; j >= w[i]; j--)
dp[j] = max(dp[j], dp[j-w[i]] + v[i]);
printf("%d\n", dp[m]);
}
return 0;
}