文件名称:the-max-sum
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:717byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
一串数字序列比如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
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.