问题描述：买书问题（编程之美1.4，动态规划解法）



编程之美书中的例子是限定了图书种类和折扣，经过分析，本程序是一种不会不限定种类的解法，所以做法会有一点点区别，但是动态规划的思想是完全一样的，只是需要根据传入的参数自动计算各个状态的最小值。



作为一种通用算法，这个解法理论上比编程之美的解法要复杂一些，下载请慎重。-Descr iption of the problem: the example of the beauty of the book to buy books (Beauty of Programming 1.4, Dynamic Programming Solution) programming is limited to the types of books and discount After analysis, the program is one that does not is not limited to the type of solution, so our approach will be a little difference, but the idea of ​ ​ dynamic programming is exactly the same, just based on the incoming parameters automatically calculate the minimum value of the various states. As a general-purpose algorithm, this solution is theoretically beauty solutions than programming complex, Download, please be careful.