uva 10130 - SuperSale(01背包简单变换)
来源:互联网 发布:web portal认证软件 编辑:程序博客网 时间:2024/06/08 09:04
1、http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1071
2、用滚动数组处理
题目:
SuperSale
There is a SuperSale in a SuperHiperMarket. Every person can take only one object of each kind, i.e. one TV, one carrot, but for extra low price. We are going with a whole family to that SuperHiperMarket. Every person can take as many objects, as he/she can carry out from the SuperSale. We have given list of objects with prices and their weight. We also know, what is the maximum weight that every person can stand. What is the maximal value of objects we can buy at SuperSale?
Input Specification
The input consists of T test cases. The number of them (1<=T<=1000) is given on the first line of the input file.
Each test case begins with a line containing a single integer number N that indicates the number of objects (1 <= N <= 1000). Then follows Nlines, each containing two integers: P and W. The first integer (1<=P<=100) corresponds to the price of object. The second integer (1<=W<=30) corresponds to the weight of object. Next line contains one integer (1<=G<=100) it’s the number of people in our group. Next G lines contains maximal weight (1<=MW<=30) that can stand this i-th person from our family (1<=i<=G).
Output Specification
For every test case your program has to determine one integer. Print out the maximal value of goods which we can buy with that family.
Sample Input
2
3
72 17
44 23
31 24
1
26
6
64 26
85 22
52 4
99 18
39 13
54 9
4
23
20
20
26
Output for the Sample Input
72
514
3、ac代码:
#include<stdio.h>#define N 1005#include<algorithm>using namespace std;#include<string.h> vstruct node{ int p; int w;} a[N];int b[N];int dp[N];int main(){ int t,n,m,sum=0; scanf("%d",&t); while(t--) { //memset(dp,0,sizeof(dp)); scanf("%d",&n); for(int i=1; i<=n; i++) scanf("%d%d",&a[i].p,&a[i].w); scanf("%d",&m); int sum=0; for(int i=1; i<=m; i++) { scanf("%d",&b[i]); } for(int k=1; k<=m; k++) {memset(dp,0,sizeof(dp)); for(int i=1; i<=n; i++) { for(int j=b[k]; j>=0; j--) { if(j>=a[i].w) dp[j]=max(dp[j],dp[j-a[i].w]+a[i].p); } } sum+=dp[b[k]]; } printf("%d\n",sum); } return 0;}/*2372 1744 2331 24126664 2685 2252 499 1839 1354 9423202026*/
- uva 10130 - SuperSale(01背包简单变换)
- uva 10130 SuperSale(01背包)
- UVA - 10130 SuperSale (01背包)
- uva 10130 SuperSale (01背包)
- uva 10130 - SuperSale(01背包)
- Uva-10130 SuperSale 01背包
- SuperSale - UVa 10130 01背包
- 【UVA】10130-SuperSale(01背包)
- UVA 10130 SuperSale(01背包)
- UVA 10130 SuperSale(背包)
- UVa 10130 - SuperSale 背包
- UVA - 10130 - SuperSale (动态规划 - 01背包)
- UVA 10130 SuperSale(dp + 01背包)
- UVa 10130 SuperSale(DP 01背包)
- UVA - 10130 SuperSale 01背包问题
- UVA 10130 SuperSale (DP 01背包)
- UVA.10130 SuperSale (DP 01背包)
- Uva 10130-SuperSale(0-1背包)
- Hdu 3530 Subsequence 单调队列
- 由一个浮点数问题引发的致命问题
- HDU_2053 Switch Game
- JQuer版---列表框移动
- 计算机是如何启动的?
- uva 10130 - SuperSale(01背包简单变换)
- int, float, double之间不得不说的故事
- 背景图上加字
- POJ 1035 Spell checker (trie树)
- 0-范数
- Linux 的启动流程
- 最简单的顺序查找
- Android开发6:布局管理器3(帧布局FrameLayout-案例霓虹灯效果用到的知识点)
- 数学中的 s.t. 含义