HDU-3449 Consumer(依赖背包)

最新推荐文章于 2021-07-13 16:24:30 发布

天夏123

最新推荐文章于 2021-07-13 16:24:30 发布

阅读量202

点赞数

分类专栏：动态规划

本文链接：https://blog.csdn.net/qq_26122039/article/details/51860239

版权

动态规划专栏收录该内容

92 篇文章 0 订阅

订阅专栏

原题链接

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 800
300 2 30 50 25 80
600 1 50 130
400 3 40 70 30 40 35 60

Sample Output

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define maxn 100005
using 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;
}