[高等教育]第三部分 动态规划.pptVIP

例如，找零钱问题 当硬币系统为2角5分、1角、5分、1分时，要找给顾客6角3分钱，怎么做？ 一般思维：0.63 = 2个0.25 + 1个0.1 + 3个0.01 所拿出的硬币个数是最少的 再如 当硬币系统为4分、3分、1分时，要找给顾客6分钱，怎么做？ 一般思维：6 = 1个4分 + 2个1分 2个3分才是最优解！ 例，5个矩阵连乘，行列数如下： The exhaustive search approach to this problem leads to considering all the subsets of the set of n items given, computing the total weight of each subset in order to identify feasible subsets, and finding a subset of the largest value among them. The knapsack problem is the best-known examples of so-called NP-hard problem. No polynomial-time algorithm is known for any NP-hard problem. Moreover, most computer scientists