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 | 3682 |
2 | ecnerwala | 3603 |
3 | Benq | 3549 |
4 | Radewoosh | 3494 |
5 | Petr | 3452 |
6 | ksun48 | 3413 |
7 | maroonrk | 3406 |
8 | Miracle03 | 3314 |
9 | scott_wu | 3313 |
10 | Um_nik | 3299 |
# | User | Contrib. |
---|---|---|
1 | 1-gon | 214 |
2 | Errichto | 189 |
3 | awoo | 188 |
4 | rng_58 | 187 |
5 | SecondThread | 186 |
6 | Um_nik | 179 |
7 | Ashishgup | 177 |
8 | maroonrk | 172 |
8 | vovuh | 172 |
8 | antontrygubO_o | 172 |
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/ :)