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 ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 161 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
A problem about LCS
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 ?
Name |
---|