搜索资源列表
31yn
- 设计一个O(n2)时间的算法，找出由n个数组成的序列的最长单调递增子序列。-design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.
LISS_FAST
- 时间复杂度为O(nlogn)的最长单调递增子序列问题的计算程序。不是动态规划算法。在一分钟之内可以计算n=10^6个元素的递增子序列。-time complexity of O (nlogn) of the longest-monotonically increasing sequence of the program. Is not dynamic programming algorithm. In a minute can be calculated n = 10 ^ 6 elements
xqhqc
- 这是一个关于最长单调递增子序列的代码能运行-This is a monotonically increasing for the longest sequences of code to run
LCS
- 实现求解整数的递增子序列。给出一串整数，求解其最长递增子序列。
lcs
- 最长子序列，问题描述： 随机生成小于等于n的自然数的一个序列，输出其最长递增子序列（任意一个即可）。 n 分别取 1000，3000，10000。 例： n=5 随机序列为 5 1 4 2 3，正确输出为1 2 3，即长度为3的递增子序列。 -lcs
-p2
- 最长公共子序列（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
number_of_subsequence
- 计算一个数列的最长递增子序列和最长递减子序列的长度-Calculation of a series of the longest increasing sub-sequence and the longest decreasing sequence of length
zuichangdizengzishulie
- 所谓子序列，就是在原序列里删掉若干个元素后剩下的序列，以字符串"abcdefg"为例子，去掉bde得到子序列"acfg" 此程序可求出它最长的单调递增子序列。 -The so-called sub-sequences, that is deleted in the original sequence in a number of elements remaining after the sequence to the string abcdefg , for example, be r
lcsLength
- 给定一个数组，通过快速排序法，把数组里面的数按照从小到大进行排序，即递增序列。然后用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
1
- 设计一个O(n*n)时间的算法，找出由n个数组成的序列的最长单调递增子序列--design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.
Job4
- 本程序实现了找出一个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
LIS
- MFC写的使用贪心算法求最小递增子序列。-calculate the longest increaing sub-sequence.
LongestIncSubSeq
- 求最长单调递增子序列。举例：原数组：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
2533
- 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++
Liss
- 本程序实现求一个给定数列的最长单调递增子序列的长度和其中的一个序列-The program seeking to achieve a given series of the longest monotone increasing subsequence of length and one sequence
LongestIncre
- 贪心算法，动态规划：最长递增子序列的实现，MFC编程。-Greedy algorithms, dynamic programming: the realization of the longest increasing subsequence, MFC programming.
Maximum-Increasing-subsequences
- 最大递增子序列，动态规划经典算法 设L=<a1,a2,…,an>是n个不同的实数的序列，L的递增子序列是这样一个子序列Lin=<aK1,ak2,…,akm>，其中k1<k2<…<km且aK1<ak2<…<akm。求最大的m值。-Maximum increment sequence, the classic dynamic programming algorithm set L = <a1,a2,…,an> Are n d
最长递增子序列
- 利用动态规划法求出，时间复杂度为O(N*2)
最长递增子序列
- 这是数据结构和算法设计中的经典案例题，代码不唯一，最长公共子序列源码和动态规划ppt分析(This is a classic case of data structure and algorithm design, the code is not unique, the largest m sub segment and source code and dynamic programming ppt analysis)
5.1 最长递增子序列
- 用c++语言采用动态规划手段完成寻找某序列的最长递增子序列(Using the dynamic programming method in c++ language to find the longest incrementing subsequence of a sequence)