Coins(多重背包)
来源:互联网 发布:html页面嵌入php代码 编辑:程序博客网 时间:2024/06/06 14:06
Whuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse 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.
3 101 2 4 2 1 12 51 4 2 10 0
84
#include<iostream> #include<algorithm>#include<string.h>#define INF 0x3f3f3f3fusing namespace std;//手表价格 int m; //单位货币的价值int val[1005];//单位货币的数量int vol[1005];int dp[100005];void Zero(int cost){for(int i=m;i>=cost;i--)dp[i]=max(dp[i],dp[i-cost]+cost);}//val*vol>>m,硬币可以无限使用,可以使用完全背包 void Com(int cost){for(int i=cost;i<=m;i++)dp[i]=max(dp[i],dp[i-cost]+cost);}//拆分vol,价格系数k*vol组成新硬币 void mul(int val,int vol){if(val*vol>=m)Com(val);else{int k=1;while(k<=vol){Zero(k*val);vol-=k;k*=2;}Zero(vol*val);}}int main(){//货币的种类 int n;while(cin>>n>>m,(n||m)){for(int i=1;i<=n;i++)cin>>val[i];for(int i=1;i<=n;i++)cin>>vol[i];memset(dp,0,sizeof(dp));for(int i=0;i<=m;i++)dp[i]=-INF;dp[0]=0;for(int i=1;i<=n;i++)mul(val[i],vol[i]);int ans=0;for(int i=1;i<=m;i++)if(dp[i]>0)ans++;cout<<ans<<endl;}return 0;}
阅读全文
0 0
- Coins(多重背包)
- Coins(多重背包)
- hdu-Coins(多重背包)
- Coins(经典)(多重背包)
- poj1742- Coins(多重背包)
- hdu2844 Coins(多重背包)
- Feast Coins(多重背包)
- HDU2844-Coins(多重背包)
- HDU2844 Coins(多重背包)
- Coins (多重背包,较好的题)
- HDU 2844 Coins(多重背包)
- pku 1742 Coins(多重背包dp)
- hdu 2844 Coins (多重背包)
- Poj 1742 Coins(多重背包)
- hdu 2844 Coins(多重背包优化)
- poj 1742 Coins (多重背包)
- [ACM] hdu 2844 Coins (多重背包)
- POJ 1742 - Coins (dp 多重背包)
- 【bzoj4566】[Haoi2016]找相同字符
- 使用Haar分类器进行面部检测【转】
- 枚举类的赋值和基本操作
- 距离变换
- ios项目的托管
- Coins(多重背包)
- OpenCV学习之椭圆曲线拟合
- java基础总结 第一天
- 高德地图实现多点标注marker和动态信息窗体
- redis的event处理过程基本流程
- 怎么实现多个jar包一起依赖
- Java面向对象简单总结(二)
- 百练2765八进制小数题解
- LeetCode Graph:M210. Course Schedule II