背包动态规划分析（Analysis of dynamic programming knapsack）.docVIP

背包动态规划分析（Analysis of dynamic programming knapsack） dynamic programming The reverse thinking method of dynamic programming Dynamic programming is a way of thinking, there is no uniform and specific mode. Dynamic programming can be investigated from many aspects, different aspects have different expressions of dynamic programming. We do not intend to impose a unified form, but to discuss the thinking method of dynamic planning from many angles, I hope everyone in the thinking of the concrete problem, also can spread from many angles, such gains will be greater. The reverse thinking method refers to the method of thinking from problem of target state down to push back the initial state or boundary condition. If the original problem can be decomposed into several smaller, essentially the same problem, naturally seek to solve the problem of Lenovo from the perspective of reverse thinking. You may think that this will be a big problem into smaller problems of thinking is not divided? Dynamic programming is not divide and rule? In fact, although we are in reverse thinking method using dynamic programming method and the analysis of the problems, the use of this problem will be summarized as examples of smaller and similar sub problems. And produce a global optimal value idea by solving sub problems, but the dynamic planning is not divided: the key lies in the nature of the decomposition of the different sub problems. The method is independent of the requirements of each sub problem (which contains public sub problems), so once recursively calculates each sub solution of the problem, can lower sub problem solution into the solution of the original problem. If the problem is not independent, then divided to do a lot of unnecessary work, solutions of public sub problems repeatedly. The dynamic programming and the difference lies in the dynamic programming method allows these sub problems are not independent (i.e. sub problems include sub problems), it solutions for each sub pr