Description: The basic idea with the divide and conquer method is similar to the problem is to be solved is decomposed into several sub-questions (stages), in order to solve sub-stages, before a sub-problem solutions for problem solving after a child has provided useful information. In any sub-problem solving, list all possible partial solutions, through making reservations that are likely to achieve optimal local solution, discarding other local solution. Order to solve each sub-problem, and finally a sub-problem is the initial solution to the problem. Dynamic programming to solve the problem because the majority of sub-problems that have overlapping characteristics, in order to reduce double counting, for each sub-problem solution only once, at different stages of its different states stored in a two-dimensional array.
To Search:
File list (Check if you may need any files):
juzhen.txt
Download