wtw's blog

A problem about LCS
By wtw, history, 8 years ago, In English

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!

  • Vote: I like it
  • -5
  • Vote: I do not like it

»
8 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by wtw (previous revision, new revision, compare).

→ Reply
»
8 years ago, # |
  Vote: I like it +24 Vote: I do not like it

http://codeforces.net/blog/entry/49769

→ Reply