LCS - Longest Common Substring

no tags 

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.




Notice: new testcases added

hide comments
minhthai: 2016-02-17 05:53:32

O(NlogN) suffix array will not work :(

Dhawal Harkawat: 2016-01-25 14:13:26

After this, try ->

Last edit: 2016-01-25 14:14:04
hanif: 2015-11-16 17:27:56

is it possible to solve this problem with rolling hash technique??

(Tjandra Satria Gunawan)(曾毅昆): 2015-08-21 17:53:02

Optimized Suffix Array -> TLE
Unoptomized Ukkonen -> AC (it's hard for me, need 1 day to understand the concept + 1 day to implement & debug it)
I'm tired but satisfied with this problem ;-)

Omer Farukh: 2015-03-14 19:37:04

Is the answer for given testcase correct ?
I am getting 8 as answer

Dhruv Mullick: 2015-01-28 12:14:40

nlogn approach gives TLE

Last edit: 2015-01-28 12:15:05
Gaurav Kumar Verma: 2014-10-16 22:11:06

Suffix Automation got AC in C++ but got TLE in JAVA, i dont understand y :(

zicowa: 2014-03-21 18:16:58

geting TLE using suffix array O(nlogn) approach

Terence: 2014-03-20 06:12:57

AC using O(N) suffix array!

knb_dtu: 2014-03-17 11:13:21

Suffix Automation gets AC:)

Added by:Bin Jin
Time limit:0.294s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C++ 5