POJ 1276 Cash Machine 单调队列优化多重背包
来源:互联网 发布:gh0st 源码下载 编辑:程序博客网 时间:2024/06/08 14:56
Cash Machine
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 33236 Accepted: 12041
Description
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.
Input
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.
Output
For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.
Sample Input
735 3 4 125 6 5 3 350
633 4 500 30 6 100 1 5 0 1
735 0
0 3 10 100 10 50 10 10
Sample Output
735
630
0
0
Hint
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 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.
Source
Southeastern Europe 2002
跑一下多重背包,然后找到最大的i使得i<=N且f[i]=1.
#include <cstdio>#include <algorithm>#include <cstring>#define MAXN 100005using namespace std;int c[MAXN],f[MAXN],a[MAXN],v[MAXN],n,s;int main(){ while(scanf("%d%d",&s,&n)!=EOF) { for(int i=1;i<=n;i++) scanf("%d%d",&c[i],&v[i]); memset(f,0,sizeof(f)); f[0]=1; for(int k=1;k<=n;k++) { for(int i=0;i<v[k];i++) { int cnt=0,l=1,r=0; for(int j=i;j<=s;j+=v[k]) { while(r-l+1>c[k]) cnt-=a[l++]; a[++r]=f[j],cnt+=f[j]; if(cnt) f[j]=1; } } } while(!f[s]) s--; printf("%d\n",s); }}
- POJ 1276 Cash Machine 单调队列优化多重背包
- POJ 1276 Cash Machine (多重背包&单调队列)
- POJ 1276 Cash Machine 多重背包+二进制优化
- poj 1276 Cash Machine(多重背包+二进制优化)
- POJ 1276 Cash Machine 多重背包--二进制优化
- POJ 1276 Cash Machine 【多重背包-二进制优化】
- POJ-1276-Cash-Machine 二进制优化多重背包问题
- 多重背包 二进制优化 POJ 1276 Cash Machine
- POJ 1276Cash Machine(多重背包 + 二进制优化)
- POJ 1276 Cash Machine(多重背包)
- poj 1276 Cash Machine(多重背包+倍增)
- poj 1276 Cash Machine(多重背包)
- POJ 1276 Cash Machine (多重背包)
- poj 1276 Cash Machine (多重背包)
- poj 1276 Cash Machine----多重背包
- POJ 1276 Cash Machine (多重背包)
- POJ 1276 Cash Machine 多重背包
- 多重背包 poj 1276 Cash Machine
- 复习
- Android NDK学习笔记11-JNI异常处理
- 性能测试
- 01背包
- 迷惘。。。。。。。
- POJ 1276 Cash Machine 单调队列优化多重背包
- (笔记)Spring实战_Spring之旅(2)_容纳你的Bean
- 【华为OJ17】坐标移动----方法一(比较麻烦)
- iOS开发 Xcode8 如何适配iOS10
- C++对象数组调用构造/析构函数的方法
- TextView 字体过长解决方案(实现手动滚动字体)
- 基础知识很重要
- Spring框架(一)
- Android NDK学习笔记10-JNI域和方法描述