Please suggest some practice problem for me that needs KMP + DP . I means such problem where the DP states depend on KMP failure function. Thanks in advance.
# | 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 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Name |
---|
346B - Lucky Common Subsequence
Thanks a lot for your kind help. Can you please suggest some more problems? I want to solve 4-5 problems to make my concept clear.
You can try this problem Unlucky Strings This problems uses
Matrix exponentiation + KMP
.At codechef: https://www.codechef.com/tags/problems/kmp At topcoder: http://community.topcoder.com/stat?c=problem_statement&pm=6017&rd=8083 and also -
MagicWords (SRM 433 D1-250/D2-500) RequiredSubstrings (SRM 519 D1-600) DengklekMessage (SRM 526 D1-1000) FoxAndMountain (SRM 557 D2-1000) At SPOJ: PRETILE, ARDA1, NHAY, PERIOD, EPLAIN, PSTRING, FINDSR, VPALIN At UVa : UVA 11475
http://acm.timus.ru/problem.aspx?space=1&num=1002
Here you go — http://www.spoj.com/problems/PSTRING/ :)