Search - longest

Search - longest - List

[Other resource] [转载]nlogn的最长子序列算法 DL : 0: 关于用nlogn的最长子序列算法，在网上摘录的-discusses the use of the longest sequences algorithm, in the extract from the Internet
Date : 2008-10-13 Size : 1.73kb User : 关安
[Other resource] 公共子序列 DL : 0: 本算法实现的是对两个单字符串的扫描，找出其最长公共子序列。-the algorithm to achieve the two-string scan, identify its longest public sequences.
Date : 2008-10-13 Size : 819byte User : 汪永威
[Other resource] xinchengxu DL : 0: 包括GRAY码，工作分配问题，会场安排，石子，行数字三角形，最长递增子序列和最小重量机器算法。利用动态规划、回溯法和贪心法-including GRAY code, work assignment, venue arrangements, gravel, and digital triangle, the longest sequences and increase the minimum weight machine algorithm. Using dynamic programming, retroactive law and the greedy algorithm
Date : 2008-10-13 Size : 5.47kb User : lw
[Other resource] K_select DL : 0: 描述：Design a program to find k longest itemsets in a database of N records. 分析：因为题目的要求是找到k longest itemsets，在本程序中为了模拟这个目的，我对算法进行简单化，即简化为这样一个题目：在若干个比较大的数字中找到k 个最大的数字，这个等价于在若干记录中找到k个最长的记录集，因为k个最大的数字自然也是最长的。思想： 1、数据由程序随机生成，保存到文件out.txt中，以进行读取。 2、这里的方法为堆排序操作，对所有的输入放置在out.txt的文件中，并逐一读入，对所有数据建造大根堆。 3、最终结果以文件的方法输出：out1.txt为选定的K-项集。 4、数值大的元素放在后部，输出时，从最后一个元素开始。 5、所有的数据都由文件调入内存进行堆筛选，在得到K-项集后再送回到文件中去，而若要是在实际数据库中则是把关键字调入内存进行筛选操作。程序的详细说明，因为涉及许多细节，所以附在原代码中，因为效率的提高往往是许多细节的改进，而这些必须定量来考察。实验环境：Win2000,Visual C++6.0,MS Access2000.mfc7.0情况下能否运行没有测试
Date : 2008-10-13 Size : 34.23kb User : 孙东一
[Other resource] LCS_Dynamic_Programming DL : 0: LCS（最长公共子序列）问题可以简单地描述如下：一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。例如，若X={A，B，C，B，D，B，A}，Y={B，D，C，A，B，A}，则序列{B，C，A}是X和Y的一个公共子序列，但它不是X和Y的一个最长公共子序列。序列{B，C，B，A}也是X和Y的一个公共子序列，它的长度为4，而且它是X和Y的一个最长公共子序列，因为X和Y没有长度大于4的公共子序列。最长公共子序列问题就是给定两个序列X={x1,x2,...xm}和Y={y1,y2,...yn}，找出X和Y的一个最长公共子序列。对于这个问题比较容易想到的算法是穷举，对X的所有子序列，检查它是否也是Y的子序列，从而确定它是否为X和Y的公共子序列，并且在检查过程中记录最长的公共子序列。X的所有子序列都检查过后即可求出X和Y的最长公共子序列。X的每个子序列相应于下标集{1,2,...,m}的一个子集。因此，共有2^m个不同子序列，从而穷举搜索法需要指数时间。 -LCS (longest public sequences) can be simply described as follows : given a sequence of sequences in the sequence is deleted after some element of the sequence. Given two sequences X and Y, Z is another sequence of the X-Y sequence is the sequences, Z is said X and Y series of public sequences. For example, if X = (A, B, C, B, D, B, A), (Y = B, D, C, A, B, A), the sequence (B, C, A) X and Y is a public sequences, it is not X and Y in a public longest sequences. Sequence (B, C, B, A) X and Y is a public sequences, and its length is 4. but it is the X and Y for a public longest sequence, X and Y because no greater than the length of the four sequences in public. The longest public sequences problem is given two sequences X = (x1, x2, ...) xm and Y = (y1, y2, ... yn), to identify X and Y in a
Date : 2008-10-13 Size : 4.63kb User : 汤烈
[Other resource] aglorithm DL : 0: 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman Branch and Bound graphic demonstration, traveling salesman Bound algorithm, Matrix multiplication dynamic programming, network Dijkstra shortest path algorithm
Date : 2008-10-13 Size : 23.14kb User : 安德里周
[Other resource] 31yn DL : 0: 设计一个O(n2)时间的算法，找出由n个数组成的序列的最长单调递增子序列。-design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.
Date : 2008-10-13 Size : 1.75kb User : 33
[Other resource] zixulie DL : 0: 一个求最长子序列的辕马~~~ 要的自己下!~~ 我也是无奈啊-a son for the longest sequence of shaft horse ~ ~ ~ themselves to the next! ~ ~ I was helpless ah
Date : 2008-10-13 Size : 1.34kb User : 陈健东
[Other resource] zuichanggonggzixulei DL : 0: 应用动态规划法求解两个字串的最长公共自序列及其长度-dynamic programming method for two of the longest string since the public sequence and length
Date : 2008-10-13 Size : 1.1kb User : 坤
[Other resource] LISS_FAST DL : 0: 时间复杂度为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 of incremental sequences.
Date : 2008-10-13 Size : 336.58kb User : 刘金义
[Other resource] linehough123 DL : 0: 这个程序检测出了图像中的直线,而且用绿色标出直线,直线断电用+表示,并且用不同颜色标出了最长的直线-this procedure detected the image straight, and marked with a green line, a straight line with power outages, and with different colors marked the longest line
Date : 2008-10-13 Size : 1.63kb User : 亿摆
[Other resource] longestCommonSeq DL : 0: 最长公共序列的C源码，随机生成字符串，GCC编译通过。-public longest sequence of C source code, randomly generated string GCC compile.
Date : 2008-10-13 Size : 1.03kb User : 宋达
[Other resource] 3.2 DL : 0: 作品：算法设计课程作业作者：陈兴学号：J04120010 操作说明： 1、最长公共子序列：用VC6.0打开文件以后输入一串数字，按“\\”为结束，输出结果。 2、背包问题用vc6.0打开文件以后按提示操作。 3、残缺棋盘问题用vc6.0打开文件以后按提示操作。 4、（3.1和3.2还有3.3）这个是课本82页的作业，基本实现了。其中3.2的算法时间复杂度不是nlogn而是n，nlogn的算法没做出来！ -entries : algorithm design courses operating Author : Bernadette school : J04120010 instructions : 1. Public longest sequences : VC6.0 open the file after importing a bunch of numbers, "\\" to the end, and the output results. 2, knapsack problem with open files after vc6.0 suggested by the operation. 3, incomplete chessboard problems with open files after vc6.0 suggested by the operators. 4, (3.1 and 3.2 have 3.3) This is a textbook 82 operations, the basic reality. 3.2 which time the algorithm complexity is not nlogn but n, nlogn algorithm never come out!
Date : 2008-10-13 Size : 809byte User : 陈兴
[Other resource] zuichanggonggongzixulie DL : 0: 本程序实现的功能是给出了两个序列，找出他们的最长的公共子序列-this program is the function of the two sequences, identifying their longest public sequences
Date : 2008-10-13 Size : 100.17kb User : liuqing
[Other resource] suffarray_c DL : 0: 后缀数组求最长公共子串这里的最长公共子串是指的连续的子串，并非经典dp的那种。 aabbc abc 这两个字符串的最长公共子串为ab 算法复杂度是o(n)的（n为两个字符串长度的和）-suffix array for the longest string of public-public here - the longest string of consecutive refers to the substring. dp is not the kind of classic. Aabbc abc two of the longest string of public substring of ab complexity of the algorithm is o (n) (n 2 and the length of the string)
Date : 2008-10-13 Size : 1.71kb User : ghost
[Other resource] DavidPeterman_C DL : 0: 问题描述：虽然离开浦口了，但在浦口校区后山大家还都有印象吧，可你知道有一座小山在冬天下大雪的时候是可以滑雪的，SEU很喜欢滑雪，这并不奇怪，因为滑雪的确很刺激，可是为了获得速度，滑雪区域必须向下倾斜，而且当你到底时不得不重新走到上面重滑。SEU想知道在这个区域中最长的滑坡。区域由一个二维数组给出。数组的每一个数字表示山坡上一个点的高度。下面是一个例子：一个人可以从一个点滑向上下左右相邻的四个点之一，当且仅当高度减小。在上面的例子中，一条可行的滑坡为24-17-16-1(从24开始，在1结束)。当然25－24-23-…－3-2-1更长。事实上，这是最长的一条。输入要求：从文件输入，输入的第一行为表示区域的二维数组的R行数和C列数（都在1到100之间）。下面是R行，每行有C个数，代表高度。输出要求：输出数据到文件，输出区域中最长滑坡的长度。输入样例： 5 5 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9 输出样例： -Problem Description : Although left Pukou, but in Pukou Campus of the mountain we also have the impression it. You know a hill under the snow in winter is the time to ski, ski SEU like, it is not surprising, because skiing is very stimulating, but in order to obtain the speed, skiing region must downward slopping. but in the end when you had to re-entering the sliding weight above. SEU would like to know the longest in the region of landslide. From the region is a two-dimensional array. Every one of the array of figures on the hillside a high point. Here is an example : a person can be slid from a point adjacent to the next around one of the four points, and only if highly reduced. In the example above, a possible landslide as 24 -17-16-1 (from 24, in a conclusion). Of course 25 -24-23
Date : 2008-10-13 Size : 780byte User : laochao
[Other resource] Longest_Rise_sub_sequences DL : 0: 最长上升子序列问题，这是本人的一篇实验报告，程序中的源代码已经在VC6下调试通过-longest rising sequences, which is one of my experiments, The procedures in the source code under debugging through VC6
Date : 2008-10-13 Size : 6.08kb User : J.K.Wang
[Other resource] xqhqc DL : 0: 这是一个关于最长单调递增子序列的代码能运行-This is a monotonically increasing for the longest sequences of code to run
Date : 2008-10-13 Size : 1.29kb User : 青菜
[Other resource] LCS(c++) DL : 0: LCS Algorithm, this is a c++ code for lcs(Longest Common Subsequence)
Date : 2008-10-13 Size : 7.91kb User : 劉逸
[Other resource] longest-common-string DL : 0: 这是动态规划中，求最长公共子序列（Longest common string）的源代码。自己编写执行。程序简单，有注释。
Date : 2008-10-13 Size : 210.85kb User : haha

« 12 »