FZU 2214 Knapsack problem (01背包)
来源:互联网 发布:turtlebot编程 编辑:程序博客网 时间:2024/06/16 12:17
Description
Given a set of n items, each with a weight w[i] and a value v[i], determine a way to choose the items into a knapsack so that the total weight is less than or equal to a given limit B and the total value is as large as possible. Find the maximum total value. (Note that each item can be only chosen once).
Input
The first line contains the integer T indicating to the number of test cases.
For each test case, the first line contains the integers n and B.
Following n lines provide the information of each item.
The i-th line contains the weight w[i] and the value v[i] of the i-th item respectively.
1 <= number of test cases <= 100
1 <= n <= 500
1 <= B, w[i] <= 1000000000
1 <= v[1]+v[2]+…+v[n] <= 5000
All the inputs are integers.
Output
For each test case, output the maximum value.
Sample Input
1
5 15
12 4
2 2
1 1
4 10
1 2
Sample Output
15
题解:01背包,但与标准模型有所不同。weight总量太大,显然不能套标准模型。我们换种思路,动态规划0~sumvalue需要的最小weight。dp初始化为0x3f3f3f3f,dp[0]初始化为0
#include <iostream>#include <cstring>using namespace std;int t, n, b, sv, w[600], v[600], dp[6000];int main() { scanf("%d", &t); while (t--) { scanf("%d%d", &n, &b); sv = 0; for (int i = 1; i <= n; ++i) { scanf("%d%d", &w[i], &v[i]); sv += v[i]; } memset(dp, 0x3f, sizeof(dp)); dp[0] = 0; int ans = 0; for (int i = 1; i <= n; ++i) { for (int j = sv; j >= v[i]; --j) { dp[j] = dp[j - v[i]] + w[i] < dp[j] ? dp[j - v[i]] + w[i] : dp[j]; if (dp[j] <= b && ans < j) ans = j; } } printf("%d\n", ans); } return 0;}
- FZU 2214 Knapsack problem (01背包)
- FZU-2214-Knapsack problem【01背包】
- FZU 2214 Knapsack problem 01背包变形
- FZU 2214 Knapsack problem 01超大背包
- FZU 2214 Knapsack problem (0/1背包)
- FZU 2214 Knapsack problem
- FZU - 2214-Knapsack problem
- FZU 2214 Knapsack problem【DP】【超大容量背包】
- FZU 2214 Knapsack problem (超大容量背包)
- 每日三题-Day6-A(FZU 2214 Knapsack problem 01背包)
- FZU Problem 2214 Knapsack problem(01背包,超大背包)——第六届福建省大学生程序设计竞赛-重现赛
- FZOJ--2214--Knapsack problem(背包)
- FZU2214 Knapsack problem--01背包
- 背包问题(Knapsack problem)之01
- FOJ2214 Knapsack problem(逆01背包)
- 背包问题(Knapsack problem)
- Knapsack Problem|背包问题
- Knapsack Problem(完全背包)
- Java命名规范
- grunt-contrib-connect 中间件middleware属性
- Trying to dismiss the presentation controller while transitioning already
- 电脑使用问题解决Point
- 在导航栏添加搜索框
- FZU 2214 Knapsack problem (01背包)
- Java制作证书的工具keytool用法总结 (转载)
- 初识AOP
- 程序优化方法——CSAPP 读书笔记
- 买车注意事项
- Python代码优化及技巧笔记(一)
- mysql(一)
- C语言极简入门-VC6.0极速安装-2
- Swift变量和常量