LCS2 - Longest Common Substring II

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 a bit harder, for some given strings, find the length of the longest common substring of them.

Here common substring means a substring of all the considered strings.


The input contains at most 10 lines, each line consists of no more than 100000 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
caoyiyuan: 2015-12-18 00:18:21

Alaways get WA on #10 sad...

duyixian: 2015-12-14 07:09:40

Alaways get WA on #4

(Tjandra Satria Gunawan)(曾毅昆): 2015-08-21 19:54:16

getting TLE :( seems that time limit is very strict for Ukkonen algo. I should learn more efficient O(n) algo than Ukkonen like McCreight algo, but maybe next time :p

adamant: 2015-01-26 15:37:57

Finally AC with an unusual trick with suffix automaton. TL is so strict :(

Added by:Bin Jin
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 CPP