搜索资源列表
lmis
- 最长单调子序列算法。时间复杂度为O(nlgn)。C++实现-Longest monotone subsequence algorithm. Time complexity is O (nlgn). C++,
montgomery
- Just a simple dynamic programming project for a CS class. Finds longest palindromic subsequence of an input string-Just a simple dynamic programming project for a CS class. Finds longest palindromic subsequence of an in
no1
- 最大子序列这是算法设计与分析课程之中的常用算法-This is the largest subsequence algorithm design and analysis of the curriculum of the commonly used algorithm
LCS
- 利用动态规划算法寻找两个list中的最长公共子序列，并分别记录了最长公共子序列的在list中的结束位置-Dynamic programming algorithm to find the two list the longest common subsequence, and recorded the longest common subsequence of the end position in the list
MaxSubSumON
- 线性时间算法求最大子序列和算法。实现软件：VS2008-Linear-time maximun contiguous subsequence sum algorithm
3.1
- 最长公共子序列问题 最长公共子序列（动态规划） 实验数据：input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。 -Longest common subsequence problem LCS (dynamic pr
longest
- 求两个子序列是最长公共子序列并输出到文件中。input.txt中的格式为X={A,B,C,D},Y={B,D}。-Find two sub-series is the longest common subsequence and output to a file. input.txt in the form X = {A, B, C, D}, Y = {B, D}.
Finding_Maximum
- Finding Maximum Contiguous Subsequence Sum using divide-and-conquer approach-Given a sequence Q of n numbers (positive and negative), the maximum subsequence of Q is the contiguous subsequence that has the maximum su
LongestSubSequence
- 用动态规划算法求最长公共子序列，并将结果输出到文件中-Using dynamic programming algorithm for getting the longest common subsequence, and the results output to a file
2533
- poj 2533 Longest Ordered Subsequence 简单的动态规划题目-poj 2533 Longest Ordered Subsequence simple dynamic programming topics
1
- 给定2个序列X={x1,x2,…,xm}和Y={y1,y2,…,yn}，找出X和Y的最长公共子序列。-Given two sequences X = {x1, x2, ..., xm} and Y = {y1, y2, ..., yn}, X and Y to find the longest common subsequence.
Ex_FileSimilarity
- 利用最长公共子序列来比较两个文件的相似度，界面美观-Using the longest common subsequence similarity to compare two files, beautiful interface
LCS
- 最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列-Longest common subsequence, also known as the longest common strings (does not require cont
LCS
- 用C++实现最长公共子序列算法的程序清单-Using C++, the longest common subsequence algorithms Listing
test1_2
- 求X和Y两个字符串的最长公共子序列。（X和Y字符串分别存放在ASCII码文件2X.txt和2Y.txt中) 要求：根据动态规划法基本设计思想，将实现任务的C语言程序代码和运行结果填写在试卷上。 -Two strings X and Y find the longest common subsequence. (X and Y strings are stored in ASCII files 2X.txt and 2Y.txt
missile
- This C file for finding largest increasing subsequence from a sequence-This is C file for finding largest increasing subsequence from a sequence
longestorder
- 动态规划思想解决的最长单调上升子序列程序，内容包含整个工程文件。-Dynamic programming to solve the longest monotonically increasing subsequence of the program, contains the entire project file.
LongestIncre
- 贪心算法，动态规划：最长递增子序列的实现，MFC编程。-Greedy algorithms, dynamic programming: the realization of the longest increasing subsequence, MFC programming.
Test
- 给定2个序列X={x1,x2,…,xm}和Y={y1,y2,…,yn}，找出X和Y的最长公共子序列。-Given two sequences X = {x1, x2, ..., xm} and Y = {y1, y2, ..., yn}, the X and Y to find the longest common subsequence.
fad
- 序列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个