Search - longest

Search - longest - List

[Windows Develop] 分项案例 DL : 0: 找到邮件列表文件中前十个最长的邮件地址，并排序输出到文件result.txt中-mailing list to find documents before the 10 longest-mail addresses and sort the output to a file which result.txt
Date : 2008-10-13 Size : 1.38mb User : 鲁昕
[Windows Develop] JOBattemper DL : 0: 单道系统作业调度:作业调度算法：分别采用先来先服务(fcfs)、最短作业优先(sjf)、响应比高者优先(hrn)的调度算法。多道系统作业调度:作业调度算法：采用先来先服务(fcfs),即按作业提交的先后次序进行调度。总是首先调度在系统中等待时间最长的作业。-Shan Road System Operation : Job Scheduling Algorithm : By using the first-come first-serve (fcfs) the shortest operating priority (sjf), the response is high priority (applications) scheduling algorithm. Multiple System Operation : Job Scheduling Algorithm : The first-come first-serve (fcfs) according to the work order dispatching. Scheduling is always first in the system waiting for the longest time work.
Date : 2008-10-13 Size : 41.45kb User : 风飘零
[Windows Develop] 分项案例 DL : 0: 找到邮件列表文件中前十个最长的邮件地址，并排序输出到文件result.txt中-mailing list to find documents before the 10 longest-mail addresses and sort the output to a file which result.txt
Date : 2025-12-26 Size : 1.38mb User : 鲁昕
[Windows Develop] Least_cost_with_greatest_flow DL : 0: 题目:求网络的最小费用最大流-C语言已经经过调试,没有问题!-topics : finding the minimum cost maximum flow-through C language has been tested and no problems!
Date : 2025-12-26 Size : 20kb User : 周琳
[Windows Develop] JOBattemper DL : 0: 单道系统作业调度:作业调度算法：分别采用先来先服务(fcfs)、最短作业优先(sjf)、响应比高者优先(hrn)的调度算法。多道系统作业调度:作业调度算法：采用先来先服务(fcfs),即按作业提交的先后次序进行调度。总是首先调度在系统中等待时间最长的作业。-Shan Road System Operation : Job Scheduling Algorithm : By using the first-come first-serve (fcfs) the shortest operating priority (sjf), the response is high priority (applications) scheduling algorithm. Multiple System Operation : Job Scheduling Algorithm : The first-come first-serve (fcfs) according to the work order dispatching. Scheduling is always first in the system waiting for the longest time work.
Date : 2025-12-26 Size : 594kb User : 风飘零
[Windows Develop] back DL : 0: 后缀数组的构造，实现了对字符串的子串的匹配及最长重复子串的查找-Suffix array construction, the realization of a substring of string matching and longest repeat substring search
Date : 2025-12-26 Size : 6kb User : 顾亚楠
[Windows Develop] kis7_key DL : 0: 8个kis7.0.125的KEY，最长可用至09年-8 kis7.0.125 the KEY, the longest available in 2009 to
Date : 2025-12-26 Size : 8kb User : 赵
[Windows Develop] HOBIT DL : 0: 经典问题，霍比特人的烦恼~~~找出一些字符串中的最长公共部分。-Classic problem, the trouble Hobbit ~ ~ ~ to find some of the longest string in the public part.
Date : 2025-12-26 Size : 411kb User : 侯坤
[Windows Develop] aa DL : 0: 用线性空间实现最长公共子序列的程序，用C++完成，程序不长，但功能完善，考虑了边界-Linear space to achieve the longest common sub-sequence of procedures, using C++ Completed, the program is not long, but with perfect functions and taking into account the boundary
Date : 2025-12-26 Size : 1kb User : yh
[Windows Develop] wordseg DL : 0: 中文字库搜索功能：一种针对可变长度关键字的引索结构，它的每一层不是靠整个关键字的值决定，而是由关键字的一个分量来确定，当然必须先满足关键字的分量在一个确定的范围内。如果要匹配某个字符串，只需要从树的根部逐层向下，搜索每一个字符是否有与之匹配的分量，能走到的最深的地方就是匹配到的最长前缀。-Chinese font search: A keyword for variable-length argument cable structure, it does not depend on each layer of the value of the entire keywords, but by a keyword to determine the quantity, of course, must first meet the keyword weight in a defined range. If you want to match a string, just from the tree root layers down, search for each character whether there are matching the amount that can come to the most is the longest prefix match.
Date : 2025-12-26 Size : 59kb User : miyalu
[Windows Develop] LCS DL : 0: 这是运用C++语言实现的有关最长公共子序列LCS问题的详细求解代码，大家可以下载看看，谢谢！-This is the use of C++ Language of the longest common sub-sequence of LCS to solve the problem in detail code, you can download and see, thank you!
Date : 2025-12-26 Size : 537kb User : 王志刚
[Windows Develop] suffixarray DL : 0: 本文中笔者想介绍一下后缀数组的基本概念、构造方法，以及配合后缀数组的最长公共前缀数组的构造方法，最后结合一些例子谈谈后缀数组的应用-In this article I want to tell us about the basic concept of suffix array, construction methods, and the suffix array with the longest prefix of an array of public constructor, and finally combined with some examples to talk about the application of suffix array
Date : 2025-12-26 Size : 7kb User : 详迅
[Windows Develop] first DL : 0: 用C++写的一个关于在n各节点中找最长路径的算法，应用了拓扑结构等，很便利-Using C++ to write about the one at the node n to find the longest path algorithm, such as the application of the topology, it is convenient
Date : 2025-12-26 Size : 84kb User : 苏子
[Windows Develop] ptcalc-src DL : 0: visual basic 6.0 source code to multiply, divide, subtract or to do arithmetic operations for biggest, longest, largest digits, numbers-visual basic 6.0 source code to multiply, divide, subtract or to do arithmetic operations for biggest, longest, largest digits, numbers
Date : 2025-12-26 Size : 142kb User : rajeshf
[Windows Develop] AutoSizeTextBox DL : 0: 根据输入文字自动调节文本框长度，有最长于最短长度设置-Adjusted automatically according to input text box text length, the shortest length of the longest in the set
Date : 2025-12-26 Size : 15kb User : chenyuli
[Windows Develop] array DL : 0: 算法的一种，找出两个字符序列中最长的共同子序列，并输出。-An algorithm to identify the two character sequence of the longest common subsequence, and output.
Date : 2025-12-26 Size : 1kb User : 郑渤龙
[Windows Develop] poj2880 DL : 0: poj2880 输入一个英文句子，长度不超过40个字符。编写程序，输出句子中最长的一个单词。 http://poj.grids.cn/problem?id=2880 可直接运行-poj2880 enter an English sentence, the length of not more than 40 characters. Programming, the output of a sentence in the longest word. http://poj.grids.cn/problem?id=2880 can be directly run
Date : 2025-12-26 Size : 818kb User : henry
[Windows Develop] The_longest_common_sub-string DL : 0: 编写一个程序，对输入的字符串s和t，求其最长的公共子字符串。-The preparation of a program, the input string s and t, for the longest common sub-string.
Date : 2025-12-26 Size : 4kb User : micmon
[Windows Develop] longest DL : 0: 求两个子序列是最长公共子序列并输出到文件中。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}.
Date : 2025-12-26 Size : 1kb User :
[Windows Develop] Longest-Palindromic-Substring DL : 0: //动态规划求最长回文子串 //用布尔型t[i][j]表示子串（s(i....j))是否为回文子串 //其中t[i][j]的值可通过t[i+1][j-1]的值以及是s[i]和s[j]是否相等判断（即子串（s(i...j))是否为回文子串可通过子问题s（i+1,...,j-1)是否为回文串来解决） //通过left和right来指示当前最长回文子串的下标-// Dynamic programming longest palindrome substring // Boolean type t [i] [j] represents the substring (s (i .... j)) whether the palindrome substring // Where t [i] [j] value by t [i+ 1] [j-1] value and is s [i] and s [j] is equal to the judgment (ie substring (s (i. ..j)) whether it is a palindrome substring problem by sub-s (i+ 1, ..., j-1) whether it is a palindrome string to resolve) // To indicate the current longest palindrome substring index by left and right
Date : 2025-12-26 Size : 2.49mb User : guopengju

« 12 3 »