Search - longest

Search - longest - List

[Other] longest DL : 0: 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
Update : 2008-10-13 Size : 8.6kb Publisher : 周子藤
[Other resource] longest-common-string DL : 0: 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。
Update : 2008-10-13 Size : 210.85kb Publisher : haha
[Other] longest common substring DL : 0: 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n * m).
Update : 2008-10-13 Size : 2.78kb Publisher : 唐海浪
[Other] longest common substring DL : 0: 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n* m).
Update : 2025-02-17 Size : 3kb Publisher : 唐海浪
[GDI-Bitmap] Hough变换的源程序 DL : 0: Hough变换用来在图象中查找直线。它的原理是：假设有一条与原点距离为s，方向角为θ的一条直线，直线上的每一点都满足方程 s=x*Cosθ+y*Sinθ，利用这个事实，我们可以找出某条直线来。这段程序，用来找出图象中最长的直线。-Hough Transformation is used for searching lines in an image . Here is the principle: Assume there is a line whoes direction is "sita" , and the distance from the origin to this line is s. So each point in this line satisfies the equation : s=x*Cos(sita)+ y*Sin(sita) . We can find out the lines based on this fact. And this programme is to find out the longest line in the image.
Update : 2025-02-17 Size : 2kb Publisher : doctorsuo
[Other] longest DL : 0: 输入一个带权图的无向图，求出其中一个顶点到其它顶点最长的路径，并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
Update : 2025-02-17 Size : 8kb Publisher : 周子藤
[Other] Dijkstra DL : 0: 求数组最长递增子序列算法。输入一个数组，输出其最大递增子序列-Array for the longest increasing subsequence algorithm. An array of input and output its maximum incremental sequence
Update : 2025-02-17 Size : 1kb Publisher : sdf
[Other Riddle games] lcs DL : 0: 算法实现题最长公共子序列问题给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )
Update : 2025-02-17 Size : 1kb Publisher : sanfy chen
[Software Engineering] LCS(c++) DL : 0: LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
Update : 2025-02-17 Size : 8kb Publisher : 劉逸
[Other] 4 DL : 0: 最长公共子序列算法的实现,还有实验报告，欢迎大家下载-The longest common sub-sequence algorithm, as well as experimental reports, welcomed everyone to download
Update : 2025-02-17 Size : 37kb Publisher : 雷远东
[Data structs] longest-common-string DL : 0: 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。-This is a dynamic planning, seeking the longest common sub-sequence (Longest common string) the source code. The preparation of the implementation of their own. Procedure is simple, there are notes.
Update : 2025-02-17 Size : 211kb Publisher : haha
[Data structs] LCS DL : 0: 使用动态规划方法,实现了最长公共子序列算法,并对动态规划方法作了时间和空间的改进-The use of dynamic programming methods, to achieve the longest common sub-sequence algorithms, and dynamic programming methods of time and space to improve
Update : 2025-02-17 Size : 263kb Publisher : 小波
[Data structs] longest DL : 0: 给出一个由非0整数组成的序列a1,a2,…,an, 设计递归算法求其中由同号整数组成的最长连续段(称为最长同号连续段)的长度。-Given a non-0 component of the sequence of integers a1, a2, ..., an, the design of recursive algorithm for one by the same integer number consisting of the longest continuous segment (known as the longest consecutive number with the above) in length.
Update : 2025-02-17 Size : 215kb Publisher : wu
[ActiveX/DCOM/ATL] lcs DL : 0: LCS Longest (maximum) common subsequence -LCS Longest (maximum) common subsequence
Update : 2025-02-17 Size : 1kb Publisher : 鲁剑锋
[Algorithm] longest DL : 0: Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, e. g., (1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, e. g., (1, 3, 5, 8). -Problem B: Longest Ordered SubsequenceA numeric sequence of ai is ordered if a1 <a2 <... <aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 <i2 <... <iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subsequences, eg, ( 1, 7), (3, 4, 8) and many others. All longest ordered subsequences are of length 4, eg, (1, 3, 5, 8).
Update : 2025-02-17 Size : 1kb Publisher : hzf
[Data structs] DP DL : 0: 最长路径DP算法根据邻近矩阵,再运用DP算法计算出图中任意节点间的最长路径,有点类似于最短路径算法-DP algorithm for the longest path in accordance with the neighboring matrix, re-use of DP algorithm to calculate arbitrary graph the longest path between nodes, somewhat similar to the shortest path algorithm
Update : 2025-02-17 Size : 2kb Publisher : yuxiqian
[Other] 1977+Algorithms+for+the+Longest+Common+Subsequence DL : 0: 最长子序列,英文版,电子书 ACM文章1977+Algorithms+for+the+Longest+Common+Subsequence+Problem-The longest sequence, in English, e-books ACM article 1977+ Algorithms+ For+ The+ Longest+ Common+ Subsequence+ Problem
Update : 2025-02-17 Size : 700kb Publisher : 张启达
[Data structs] longest DL : 0: 这是暑假写的最长公共子序列算法，呵呵，欢迎大家来下载-Writing This is the longest summer vacation of public sequence algorithm, huh, huh, welcome everyone to download
Update : 2025-02-17 Size : 168kb Publisher : zuoxue
[CSharp] TheLongestCommonSubsequence DL : 0: 本代码是用c#来实现最长公共子序列算法。-The c# code is used to achieve the longest common sub-sequence algorithm.
Update : 2025-02-17 Size : 26kb Publisher : 堂堂
[ActiveX/DCOM/ATL] lcs DL : 0: Longest Common Subsequence Problem. Solution both Iterative and Recursive.
Update : 2025-02-17 Size : 1kb Publisher : gowdd

« 12 3 4 5 6 7 8 9 10 ... 38 »