POJ1276-Cash Machine(多重背包)

原创

于 2017-10-07 21:57:41 发布 · 526 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#dp #背包 #多重背包

该博客介绍了如何解决POJ1276问题，即给定数值和不同面值、数量的钞票，求最接近但不超过数值的最大总和。博主分享了使用多重背包策略来求解此问题，并提供了输入、输出示例及代码实现，但部分内容有待补充。

题目链接:poj挂了以后补上

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.