Description: The basic idea of dynamic programming is to solve the problem into a number of stages or
Multiple sub-problems, and then follow the order of the various sub-problems to solve. The problem before the solution of a son and a son, after solving the problem of providing useful information. Any child in solving problems, list possible local solutions, which may be retained by making the local optimal solution, discard the other partial solutions. In order to solve the various sub-problems, the solution of the last sub-problem is the solution of the original problem. Dynamic programming algorithm and divide and conquer method similar, but the difference is in the use of dynamic programming to solve problems in various sub-problems are often not independent of each other. As the dynamic programming algorithm to solve the problem often have the characteristics of overlapping sub-problems, so in order to reduce double counting, regardless of whether the sub-problem after being u
To Search:
File list (Check if you may need any files):
dongtaiguihua.txt
Download