HDU-3449 Consumer(依赖背包)
来源:互联网 发布:linux alias 多条命令 编辑:程序博客网 时间:2024/05/21 06:25
原题链接
Consumer
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 1983 Accepted Submission(s): 1063
Problem Description
FJ is going to do some shopping, and before that, he needs some boxes to carry the different kinds of stuff he is going to buy. Each box is assigned to carry some specific kinds of stuff (that is to say, if he is going to buy one of these stuff, he has to buy the box beforehand). Each kind of stuff has its own value. Now FJ only has an amount of W dollars for shopping, he intends to get the highest value with the money.
Input
The first line will contain two integers, n (the number of boxes 1 <= n <= 50), w (the amount of money FJ has, 1 <= w <= 100000) Then n lines follow. Each line contains the following number pi (the price of the ith box 1<=pi<=1000), mi (1<=mi<=10 the number goods ith box can carry), and mi pairs of numbers, the price cj (1<=cj<=100), the value vj(1<=vj<=1000000)
Output
For each test case, output the maximum value FJ can get
Sample Input
3 800300 2 30 50 25 80600 1 50 130400 3 40 70 30 40 35 60
Sample Output
210
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <vector>#define maxn 100005using namespace std;typedef long long ll;int dp[maxn], k[maxn];int main(){//freopen("in.txt", "r", stdin);int n, w;while(scanf("%d%d", &n, &w) == 2){memset(dp, 0, sizeof(dp));int p, m, a, b;for(int i = 0; i < n; i++){scanf("%d%d", &p, &m);for(int j = p; j <=w; j++) k[j] = dp[j-p];while(m--){scanf("%d%d", &a, &b);for(int j = w; j >= p+a; j--) k[j] = max(k[j], k[j-a]+b);}for(int j = p; j <= w; j++) dp[j] = max(k[j], dp[j]);}printf("%d\n", dp[w]);}return 0;}
0 0
- hdu 3449 Consumer 依赖背包
- hdu 3449 Consumer 依赖背包~~
- hdu 3449(依赖背包) Consumer
- HDU-3449 Consumer(依赖背包)
- HDU 3449 Consumer (依赖背包)
- HDU 3449 Consumer 依赖背包
- HDU 3449 Consumer(依赖背包)
- HDU 3449 Consumer (依赖背包)
- HDU 3449 Consumer 依赖背包 入门题
- hdu 3449 Consumer (依赖01背包)
- HDU 3449 Consumer 【有依赖背包】【dp】
- HDU 3449 Consumer(依赖背包)
- hdu 3449 Consumer(依赖背包)
- HDU-3449 Consumer(有依赖背包)
- HDU 3449 Consumer(有依赖背包)
- hdu 3449 Consumer 依赖背包 经典的背包类型
- HDU 3449—— Consumer(有依赖的背包)
- hdu 3449 Consumer 有依赖的01背包
- scala spark hbase 操作案例
- (原创软件)CnCrypt 密码生成工具,提取自CnCrypt的一个独立版本
- 初识DEV控件
- Android View动效地址
- jQuery选择器总结
- HDU-3449 Consumer(依赖背包)
- SQLite数据库操作
- [mt6735]10.1寸 LCD 驱动添加
- 转载:Android Camera 3D效果
- 鲁肃分享怎么做技术&业务leader
- eclipse常用快捷键
- Windows自带Android模拟器启动失败
- android悬浮窗口的实现
- 直接插入排序