POJ 1742 Coins 多重背包用单调队列优化
来源:互联网 发布:手机网络电视直播下载 编辑:程序博客网 时间:2024/05/21 21:01
多重背包用单调队列优化
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#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=100000+10;int c[maxn],w[maxn],use[maxn],f[maxn];int main(){int n,m;while(scanf("%d%d",&n,&m)&&n&&m){int ans=0;for(int i=1;i<=n;i++){scanf("%d",&w[i]);}for(int i=1;i<=n;i++){scanf("%d",&c[i]);}memset(f,0,sizeof(f));f[0]=1;for(int i=1;i<=n;i++){memset(use,0,sizeof(use));for(int j=w[i];j<=m;j++){if(!f[j]&&f[j-w[i]]&&(use[j-w[i]]+1<=c[i])){f[j]=1;use[j]=use[j-w[i]]+1;ans++;}}}printf("%d\n",ans);}return 0;}
0 0
- POJ 1742 Coins 多重背包用单调队列优化
- POJ 1742 Coins 多重背包(单调队列优化)
- poj 1742 Coins 单调队列优化多重背包
- POJ 1742 Coins( 单调队列优化多重背包)
- POJ 1742 Coins 单调队列多重背包
- POJ 1742:Coins——单调队列优化的多重背包
- POJ 1742 Coins——不要套单调队列优化多重背包的模板
- poj 1742 Coins dp 多重背包 优化
- poj-1742 Coins(多重背包优化)
- poj 1742 多重背包(单调队列)
- poj 1276 多重背包+二进制优化+单调队列优化
- 多重背包单调队列优化
- 单调队列优化多重背包
- 单调队列优化多重背包
- 单调队列优化多重背包
- POJ 1014 Dividing 单调队列优化多重背包
- POJ 1276 Cash Machine 单调队列优化多重背包
- poj 1742 Coins(多重背包)
- 日拱一卒的意义在哪
- java string 字符串替换
- Android学习-安卓项目类别
- Makefile VPATH和vpath
- JDBC的简单实现
- POJ 1742 Coins 多重背包用单调队列优化
- 新的开始
- php foreach循环时 注意事项
- android中常用的弹出提示框
- HDU4834 JZP Set 2014年百度之星程序设计大赛 - 初赛(第二轮) 数学
- POJ 1006
- ConcurrentHashMap原理分析
- hdu-1021 Fibonacci Again
- LUA中的metatable笔记 (metatable的默认元素)