LCS - Longest Common Substring
A string is finite sequence of characters over a non-empty finite set Σ.
In this problem, Σ is the set of lowercase letters.
Substring, also called factor, is a consecutive sequence of characters occurrences at least once in a string.
Now your task is simple, for two given strings, find the length of the longest common substring of them.
Here common substring means a substring of two or more strings.
The input contains exactly two lines, each line consists of no more than 250000 lowercase letters, representing a string.
The length of the longest common substring. If such string doesn't exist, print "0" instead.
Input: alsdfkjfjkdsal fdjskalajfkdsla Output: 3
Notice: new testcases added
O(NlogN) suffix array will not work :(
After this, try -> http://www.spoj.com/problems/LCS2/
is it possible to solve this problem with rolling hash technique??
(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
Optimized Suffix Array -> TLE
Is the answer for given testcase correct ?
nlogn approach gives TLELast edit: 2015-01-28 12:15:05
Gaurav Kumar Verma:
Suffix Automation got AC in C++ but got TLE in JAVA, i dont understand y :(
geting TLE using suffix array O(nlogn) approach
AC using O(N) suffix array!
Suffix Automation gets AC:)