hdoj Consumer 3449 (背包)好题
来源:互联网 发布:珠海网络推广公司 编辑:程序博客网 时间:2024/05/29 14:29
Consumer
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others)Total Submission(s): 1897 Accepted Submission(s): 1010
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/*题意:每种类型的物品要一个箱子中,并且每个箱子都得花钱买,问最终卖得的物品的最大价值。 给你两个数 n,w,n表示有n中类型的物品,w表示总钱数。接下来有n行,每行先输入两个数ww(箱子的价格),t(此箱中放的物品数), 接着输入t对数,每对数有c(表示物品的价格),v(表示物品的价值) */#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#define ll long long#define N 100010using namespace std;ll dp[N];ll a[N];int main(){int n,w;int ww,t;int i,j,k; while(scanf("%d%d",&n,&w)!=EOF){memset(dp,0,sizeof(dp));for(i=0;i<n;i++){scanf("%d%d",&ww,&t);for(j=0;j+ww<=w;j++)a[j+ww]=dp[j];for(j=1;j<=t;j++){int c,v;scanf("%d%d",&c,&v);for(k=w;k>=c+ww;k--)a[k]=max(a[k],a[k-c]+v);}for(j=ww;j<=w;j++)dp[j]=max(dp[j],a[j]);}printf("%lld\n",dp[w]);}return 0;}
0 0
- hdoj Consumer 3449 (背包)好题
- HDOJ 题目3449 Consumer(背包)
- hdoj 3449 Consumer 【依赖背包】
- hdoj 3449 Consumer(有依赖的背包)
- HDOJ Robberies(好题背包)
- HDU 3449 Consumer 依赖背包 入门题
- HDU 3449 Consumer(依赖背包)
- HDU 3449 Consumer (依赖背包)
- hdu 3449 Consumer (依赖01背包)
- HDU 3449 Consumer(依赖背包)
- hdu 3449 Consumer(依赖背包)
- hdoj In Action 3339 (dijiks++01背包) 好题
- hdoj Robberies 2955 (概率Dp&&01背包) 好题
- hdoj--2955--Robberies(背包好题)
- hdu 3449 Consumer 依赖背包
- hdu 3449 Consumer 依赖背包~~
- hdu 3449(依赖背包) Consumer
- HDU-3449 Consumer(依赖背包)
- Android学习笔记之AndroidManifest.xml文件解析
- elasticsearchException[Failed to load logging configuration]
- Android疯狂讲义中,基于回调的事件处理,报错Binary XML file line #8: Error inflating class org.crazyit.event.MyButton
- symfony2 EventDispatcher组件使用
- 求字符串的所有字序列(暴力法)
- hdoj Consumer 3449 (背包)好题
- EXCEL导入到SQL Server经常出现“文本被截断,或者一个或多个字符在目标代码页中没有匹配项”错误的解决
- 四大对象关系图
- 有关修改mac地址过程中配置选项中没有“修改本地mac地址”选项的解决方法
- 文件格式转换
- git 常用命令
- 如何在Jmeter中使用外部的java文件
- the method of resolve the problem that easyuefi can not select other hard disk as a bootable disk
- 视频制作