文件名称:include
介绍说明--下载内容均来自于网络,请自行研究使用
当要求解一个输入规模为n,且n的取值相当大的问题时,的,如果问题可以分成k个不同子集合,得到k个不同的可独立求解的子问题,其中1<k≤n,而且子问题与原问题性质相同,原问题的解可由这些子问题的解合并得出。那末,对于这类问题分治法是十分有效的。-When the solution of an input size n, and N values considerable problems when, if the problem can be into k different sub set, get k different can be solved independently of the sub problems, which 1<k is less than or equal to N, and sub problems and the original problem is of the same nature, the original problem solution by these subproblems merge solution obtained. Then, is a very effective method for this kind of problem.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
include.docx