Description: Dynamic programming algorithm with the maximum m sub-section and the problem, given a sequence of N integers, and a positive integer m, required to determine the sequence of m disjoint sub-section, so that the sum of m sub-section maximum
To Search:
File list (Check if you may need any files):
最大m子段和问题MaxSum(正确).cpp
Download