不设找零 No Change (nochange) usaco2013 题解

最新推荐文章于 2019-07-21 16:32:00 发布

El_Shaarawy_S

最新推荐文章于 2019-07-21 16:32:00 发布

阅读量1.7k

点赞数

分类专栏：状态压缩动态规划题解文章标签： usaco2013

本文链接：https://blog.csdn.net/El_Shaarawy_S/article/details/47811137

版权

本文详细介绍了USACO2013竞赛中的不设找零问题，FJ需要购买N件物品，每件物品价值不同，硬币面值在1到1亿之间，且市场没有零钱找。文章讨论了如何计算FJ购物后最多能剩下多少钱，以及如何通过动态规划解决此问题。

摘要由CSDN通过智能技术生成

题目描述

Farmer John is at the market to purchase supplies for his farm. He has in his pocket K coins (1 <= K <= 16), each with value in the range 1..100,000,000. FJ would like to make a sequence of N purchases (1 <= N <= 100,000), where the ith purchase costs c(i) units of money (1 <= c(i) <= 10,000). As he makes this sequence of purchases, he can periodically stop and pay, with a single coin, for all the purchases made since his last payment (of course, the single coin he uses must be large enough to pay for all of these). Unfortunately, the vendors at the market are completely out of change, so whenever FJ uses a coin that is larger than the amount of money he owes, he sadly receives no changes in return!

Please compute the maximum amount of money FJ can end up with after making his N purchases in sequence. Output -1 if it is impossible for FJ to make all of his purchases.

FJ正在市场上为他的农场采购日用品，他口袋里有K(1<=K<=16)个硬币，每一个硬币的面值均在1～1,00,000,000之间。FJ有一个包含N(1<=N<=100,000)种待购物品的序列清单，其中第i种物品需要的钱数为c(i)，（1<= c(i) <=10,000），在购物的过程中，物品必须按照清单顺序购买，他随时可以停下来用一枚硬币付一次钱，每次付钱的对象为从上次付钱之后至当前所有物品价值和（当然，他所付的硬币面值也必须足够大），不巧的是，市场上的商户们都没有零钱了，因此如果FJ给的硬币面值大于所