Can someone help me to solve this 346B - Lucky Common Subsequence
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Can someone help me to solve this 346B - Lucky Common Subsequence
Name |
---|
Why don't you read the editorial http://codeforces.me/blog/entry/8903
I read it but I didn't understand the logic behind it.So thought someone would explain it in simple way.
dp[i][j][k] : max { length(s) : s is LCS of s1[0,i[ and s2[0,j[, suffix of s and virus share k chars }.
use KMP to do the state transition.
Thanks.got some clarity now.