poj 1742(多重背包)
来源:互联网 发布:英语提高的方法 知乎 编辑:程序博客网 时间:2024/05/12 18:09
Coins
Time Limit: 3000MS Memory Limit: 30000KTotal Submissions: 33224 Accepted: 11279
Description
People in Silverland use coins.They have coins of value A1,A2,A3...An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby shop. He wanted to pay the exact price(without change) and he known the price would not more than m.But he didn't know the exact price of the watch.
You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cn corresponding to the number of Tony's coins of value A1,A2,A3...An then calculate how many prices(form 1 to m) Tony can pay use these coins.
You are to write a program which reads n,m,A1,A2,A3...An and C1,C2,C3...Cn corresponding to the number of Tony's coins of value A1,A2,A3...An then calculate how many prices(form 1 to m) Tony can pay use these coins.
Input
The input contains several test cases. The first line of each test case contains two integers n(1<=n<=100),m(m<=100000).The second line contains 2n integers, denoting A1,A2,A3...An,C1,C2,C3...Cn (1<=Ai<=100000,1<=Ci<=1000). The last test case is followed by two zeros.
Output
For each test case output the answer on a single line.
Sample Input
3 101 2 4 2 1 12 51 4 2 10 0
Sample Output
84
Source
LouTiancheng@POJ
裸的多重背包 不能用自带的max函数 时间耗费太大了 会超时
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;int a[200];int num[200];int dp[100005];int n,m;void ZeroOnePack(int w,int v){ for(int i=m;i>=w;i--) if(dp[i-w]+v>dp[i]) dp[i]=dp[i-w]+v;}void CompletePack(int w,int v){ for(int i=w;i<=m;i++) if(dp[i-w]+v>dp[i]) dp[i]=dp[i-w]+v;}void MultiplePack(){ for(int i=1;i<=n;i++) { if(a[i]*num[i]>=m) CompletePack(a[i],a[i]); else { int k=1; while(k<num[i]) { ZeroOnePack(a[i]*k,a[i]*k); num[i]-=k; k*=2; } ZeroOnePack(a[i]*num[i],a[i]*num[i]); } }}int main(){ while(~scanf("%d%d",&n,&m)&&(n+m)) { memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) scanf("%d",a+i); for(int i=1;i<=n;i++) scanf("%d",num+i); MultiplePack(); int res=0; for(int i=1;i<=m;i++) if(dp[i]==i) res++; printf("%d\n",res); } return 0;}
0 0
- POJ 1742 多重背包
- poj 1742 多重背包
- poj 1742多重背包
- poj 1742 多重背包
- poj 1742(多重背包)
- POJ 1742 多重背包
- POJ 1742 多重背包问题
- poj 1742 Coins(多重背包)
- poj 1742 多重背包可行性
- poj 1742 coins_多重背包
- poj 1742 Coins(多重背包)
- POJ-1742(多重背包)
- POJ-1742-多重背包-Coins
- POJ 1742 Coins (多重背包)
- POJ 1742多重背包问题
- poj 1742 多重背包入门
- Poj 1742 Coins【多重背包】
- poj 1742 多重背包,可行性
- Linux学习(2)——根文件系统详解
- Shell中的特殊变量$?-查看上一条Shell命令的退出状态码(exit status)
- sdau-2 1001
- Android学习(12) -- 返回键(Back)与Home键区别
- 图片背景网页在网站建设中的运用
- poj 1742(多重背包)
- 【Android基础】通过SharedPreferences来保存数据
- Asp.net WebAPi gzip压缩和json格式化
- 如何回答「为什么想来我们公司」【面试核心问题2】
- [BZOJ2005][Noi2010]能量采集
- C++自学摘要
- Linux C语言 网络编程(二) 服务器模型
- “Wishare杯”南邮第八届大学生程序设计竞赛之网络预赛 题解报告
- iis_kangle_https压力测试