文件名称:the-max-sum
介绍说明－－下载内容均来自于网络，请自行研究使用
一串数字序列比如1，3，4，5，7，6……得到其中的最带不连续子序列（要求序列是严格递增的如1，3，4，5，7可以，5，7，6就不可以）
本代码即，最大不连续子序列问题，属于经典的动态规划问题适合初学者-A string of number sequences such as 1,3,4,5,7,6 ... ... be one of the best sequence with discontinuous (which requires a strictly increasing sequence, such as 1,3,4,5,7 can, 5,7, 6 not be able to) the code that is the biggest problem is not a continuous sequence, belonging to the classic dynamic programming for beginners
本代码即，最大不连续子序列问题，属于经典的动态规划问题适合初学者-A string of number sequences such as 1,3,4,5,7,6 ... ... be one of the best sequence with discontinuous (which requires a strictly increasing sequence, such as 1,3,4,5,7 can, 5,7, 6 not be able to) the code that is the biggest problem is not a continuous sequence, belonging to the classic dynamic programming for beginners
(系统自动生成,下载前可以参看下载内容)
下载文件列表
the max sum.txt