文件名称:The-longest-Masuga-Ko-sequence
介绍说明－－下载内容均来自于网络，请自行研究使用
∏=｛8，7，4，2，5，1，9，3，10，6｝
f(j)以第j个元素Pi(j)为最后一个元素的最长增长子序列的长度。
f(j) = max{f(i)+1, 1}, a[i]<a[j], 0<i<j
-Π = {8,7,4,2,5,1,9,3,10,6} f (j) to the j-th element Pi (j) is the last element of the longest length of the growth promoter sequence. f (j) = max {f (i)+1, 1}, a [i] <a[j], 0<i<j
f(j)以第j个元素Pi(j)为最后一个元素的最长增长子序列的长度。
f(j) = max{f(i)+1, 1}, a[i]<a[j], 0<i<j
-Π = {8,7,4,2,5,1,9,3,10,6} f (j) to the j-th element Pi (j) is the last element of the longest length of the growth promoter sequence. f (j) = max {f (i)+1, 1}, a [i] <a[j], 0<i<j
(系统自动生成,下载前可以参看下载内容)
下载文件列表
The longest Masuga Ko sequence.cpp