CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - longest
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - longest - List
[
Console
]
HW2
DL : 0
we solve the LCS (LONGEST COMMON SUBSTRİ NG ) problem in this code with two different way One of them is dynamic programming.
Date
: 2025-12-26
Size
: 129kb
User
:
burcin
[
Console
]
test
DL : 0
这是一道acm程序设计大赛中的一道题目的答案,题目为简易版最长序列-This is a acm programming contest in the subject together with the answer to the title sequence for the simple version of the longest
Date
: 2025-12-26
Size
: 344kb
User
:
明白
[
Console
]
MaxStr
DL : 0
找出字符串中最长的数字串,采用在windwow下的c实现-find the longest digital string in a string
Date
: 2025-12-26
Size
: 1kb
User
:
媛焦
[
Console
]
DP-Navie-LongestCommonSubstring
DL : 0
给出了一种基于动态规划的最长公共子串算法(vc),以及一种朴素算法。-There two Longest common substring algorithms writen in VC in this document.One is based on the dynamic programming, the other is naive.
Date
: 2025-12-26
Size
: 2kb
User
:
lin
[
Console
]
code1104
DL : 0
求一个整数数组最长递减子序列,完整的C++代码,已测试通过。-Seeking an array of integers longest decreasing sub-sequence, complete C++ code, have been tested.
Date
: 2025-12-26
Size
: 1kb
User
:
邹建平
[
Console
]
13Mar
DL : 0
文档包含着两部分内容:最长公共子串算法实现以及TLS(线程局部存储)的实现代码。-The document contains two parts: the longest common substring algorithm as well as the implementation of the code of the TLS (thread local storage).
Date
: 2025-12-26
Size
: 4.35mb
User
:
郑光果
[
Console
]
migong
DL : 0
迷宫问题,程序根据用户选择的大小生成一个随机迷宫,由用户输入两组坐标分别作为迷宫的出口和入口,程序计算从出口到入口的所有路径,找到最短和最长路径并输出路径信息。-Maze problem, according to the user to select the size of the program generates a random maze, two sets of coordinates were entered by the user as the entrance and exit of the maze, the program calculates from the outlet to the inlet of all paths to find the shortest and longest path and output path information.
Date
: 2025-12-26
Size
: 2kb
User
:
zs
[
Console
]
S
DL : 0
Misakamm喜欢和她的男朋友一起滑雪这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜, 而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Misakamm想知道载一个区域中最长底滑坡。-Misakamm like to ski with her boyfriend This is not surprising, because the ski is indeed very exciting. However, in order to gain speed, slippery areas must be downward, and when you slide into the base, you have to go again or wait for the lift slope to set you. Misakamm want to know the end of the longest region containing a landslide.
Date
: 2025-12-26
Size
: 1kb
User
:
王涛
[
Console
]
Longest-Prefix
DL : 0
the solution to the usaco problem Longest prefix
Date
: 2025-12-26
Size
: 254kb
User
:
fang
[
Console
]
cpp
DL : 0
玩游戏扣奖金,最长不下降序列,邮局问题,算法作业-Play games bonus deduction, the longest sequence does not drop, the post office problem, algorithms work
Date
: 2025-12-26
Size
: 2kb
User
:
quanru
[
Console
]
Code
DL : 0
Integers is given a rectangular matrix. define: 1) The number of rows containing at least one zero element 2) the number of the column in which the longest series of the same elements
Date
: 2025-12-26
Size
: 1kb
User
:
Nikola
[
Console
]
Code
DL : 0
Integers is given a rectangular matrix. define: 1) The number of rows containing at least one zero element 2) The number of the column in which the longest series of the same elements
Date
: 2025-12-26
Size
: 1kb
User
:
Nikola
[
Console
]
zi-dian
DL : 0
字典树设集合S由若干单词(英文)组成,给定字符串K,在S中查找与K最佳匹配的结果。最佳匹配的结果定义为:与K有最长共同前缀的字符串。 例:S={abc, bdef, zhen, zhao, abdd},K1=zhao,K2=abdf,K3=cheng,则与K1最匹配的结果是zhao,与K2最匹配的结果是abdd,与K3最匹配的结果是ε(空串)。 -Dictionary tree set S by a number of words (English), given the string K, in the S to find the best match results K. The result of the best matching is defined as the string of the longest common prefix with K. Cases: S={abc, bdef, Zhen, Zhao, abdd}, K1=zhao, K2=abdf, K3=cheng, and K1 the matching result is Zhao, K2 and the matching result is abdd, K3 and the matching result is epsilon (empty string).
Date
: 2025-12-26
Size
: 669kb
User
:
yyy
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.