多重背包优化
来源:互联网 发布:js availheight 编辑:程序博客网 时间:2024/06/08 16:14
A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example,
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10
means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.
Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.
Notes:
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10
means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each.
Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine.
Notes:
@ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc.
The program input is from standard input. Each data set in the input stands for a particular transaction and has the format:
cash N n1 D1 n2 D2 ... nN DN
where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.
cash N n1 D1 n2 D2 ... nN DN
where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct.
For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.
735 3 4 125 6 5 3 350633 4 500 30 6 100 1 5 0 1735 00 3 10 100 10 50 10 10
73563000
The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash.
In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash.
题意:多重背包,使钱数最大。先拆物品,转化成01背包
代码:
#include<iostream> #include<math.h> #include<string.h>#include<stdio.h> using namespace std; int main() { int n,m; while(scanf("%d %d",&n,&m)!=EOF) { int value[1000]; int dp[100010];memset(dp,0,sizeof(dp)); int ans=0; for(int i=0;i<m;i++) { int num,v; scanf("%d %d",&num,&v); //体积 for(int j=1;num>0;j=j*2) { if(num>=j) { num=num-j;
value[ans]=j*v;//转化后的价值
// w[ans]=j*w;转化后的体积 ans++; } else {value[ans]=num*v;
//w[ans]=num*w;num=0;ans++; } } // for(int i=0;i<ans;i++)// {// printf("%d ",value[i]);// } } for(int i=0;i<ans;i++) { for(int j=n;j>=value[i];j--) { dp[j]=max(dp[j],dp[j-value[i]]+value[i]); } } printf("%d\n",dp[n]); } return 0; }
阅读全文
0 0
- 多重背包二进制优化
- 多重背包二进制优化
- 多重背包二进制优化
- 多重背包--二进制优化
- 多重背包优化
- 多重背包优化
- 多重背包及优化
- 多重背包的优化
- 队列优化多重背包
- hdu1059Dividing 多重背包二进制优化
- HDU 2844 多重背包优化
- HDU1059Dividing 二进制优化多重背包
- 多重背包单调队列优化
- HDU2844_Coins【多重背包】【二进制优化】
- Dividing(多重背包+二进制优化)
- HDOJ2844Coins【多重背包+二进制优化】
- POJ1014Dividing【多重背包+二进制优化】
- hdu3732 多重背包+二进制优化
- Java中堆内存和栈内存详解
- Thinkphp 引入dll类步奏
- 存储能力惊人 哈佛科学家将一部电影上传到了DNA中
- pdb for debug
- FlexBox 布局属性概念梳理
- 多重背包优化
- centos6安装xgboost0.6
- Scala 的构建工具 SBT 镜像设置
- JS中栈内存和堆内存的区别
- 僵尸进程和孤儿进程
- AJAX请求和普通HTTP请求区别
- hibernate的gethibernatetemplate find条件查询方法
- RF+Appium环境配置二:Test Setup & Teardown
- registry v2的一些心得