搜索资源列表
-
0下载：
最长公共子序列（LCS），最长递增子序列（LIS），最长公共递增子序列（LCIS）的实现，根据《算法导论》英文版的伪代码改写成C语言版本，测试完美通过。-The longest common sub-sequence (LCS), the longest increasing subsequence (LIS), the longest sequence of public increments (LCIS) of the realization, according to " Intr
-
-
0下载：
给定一个数组，通过快速排序法，把数组里面的数按照从小到大进行排序，即递增序列。然后用lcsLength函数找出最长递增子序列。-Given an array by quicksort method, the number inside the array from small to large in accordance with the sort, that is, incremental sequence. LcsLength function and then find the longe
-
-
0下载：
本程序实现了找出一个n个数的序列中最长的单调递增子序列,并符带测试数据-This program implements to find a sequence of n the number of the longest monotonically increasing subsequence, and to break with the test data
-
-
0下载：
求最长单调递增子序列。举例：原数组：1 5 1 3 1 56 21 6 86 2 1 6 5 22 1 5 9 62 1 3 56 31 1 56 3 1 1 66 3 1 6 6 3 1 6 6 1
结果：
the longest monotonically increasing sub-sequence:
Length: 14
Content:-Seeking the longest monotonically increasing subsequence. For exam
-
-
0下载：
A Fast Algorithm for Computing a Longest Common Increasing
Subsequence
-
-
0下载：
poj上的第2533题，用dp实现求一个字符串的最长递增子序列，时间是O(n)，语言是C-poj the first 2533 title, with dp achieve demand a string of the longest increasing subsequence, the time is O (n), the language is C++
-
-
0下载：
本程序实现求一个给定数列的最长单调递增子序列的长度和其中的一个序列-The program seeking to achieve a given series of the longest monotone increasing subsequence of length and one sequence
-
-
0下载：
Longest Common Subsequence
A simple way of finding the longest increasing subsequence is to use the Longest Common Subsequence (Dynamic Programming) algorithm.
1. Make a sorted copy of the sequence A, denoted as B. O(nlog(n)) time.
2.
-
-
0下载：
动态规划思想解决的最长单调上升子序列程序，内容包含整个工程文件。-Dynamic programming to solve the longest monotonically increasing subsequence of the program, contains the entire project file.
-
-
0下载：
贪心算法，动态规划：最长递增子序列的实现，MFC编程。-Greedy algorithms, dynamic programming: the realization of the longest increasing subsequence, MFC programming.
-
-
0下载：
序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。
一般地，给定一个序列X=<x1,x2,…,xm>，则另一个序列Z=<z1,z2,…,zk>是X的子序列，是指存在一个严格递增的下标序列〈i1,i2,…,ik〉使得对于所有j=1,2,…,k使Z中第j个元素zj与X中第ij个元素相同。
给定2个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z
-
-
0下载：
一个用于计算最长递增子列的代码，值得玩味。-A code used to calculate the longest increasing subsequence, worth pondering.
-
-
0下载：
3-1 Longest Increasing Subsequence
-
-
0下载：
最长递增子序列
问题描述： 随机生成小于等于n的自然数的一个序列，
输出其最长递增子序列（任意一个即可）。
n 分别取 1000，3000，10000。
例： n=5 随机序列为 5 1 4 2 3，正确输出为1 2 3，
即长度为3的递增子序列。
提示：参考LCS，思考能否达到时间复杂度（O(nlogn)）
-Longest increasing subsequence problem descr iption: randomly generate
-
-
2下载：
数据结构 动态规划算法 最长递增子序列的C语言代码-Data structures dynamic programming algorithm longest increasing subsequence of C language code
-
-
0下载：
This an NlogN solution for longest increasing subsequence-This is an NlogN solution for longest increasing subsequence
-
