A problem about LCS

Правка en2, от wtw, 2017-03-08 16:24:55

I have met a problem about LCS so hard for me. There are two strings S1,S2. |S1|,|S2|<=5000. Let n is the max length of two strings. Is there a O(n^2)solution which can find S2's all subtrings's longest common sequence with S1 ? Most thanks!

Теги lcs, hard problem for me

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский wtw 2017-03-08 16:24:55 14 Tiny change: ' with S1 ?' -> ' with S1 ?\nMost thanks!'
en1 Английский wtw 2017-03-08 16:24:00 266 Initial revision (published)