Obsessive String The first part of substring search(using KMP ) is clear. I was going through the editorial but the DP state is unclear to me. Is it some standard counting technique. If yes could anyone provide similar problem links ?
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3764 |
| 2 | slime | 3592 |
| 3 | maroonrk | 3535 |
| 4 | Benq | 3513 |
| 5 | jiangly | 3509 |
| 6 | ecnerwala | 3508 |
| 7 | MiracleFaFa | 3466 |
| 8 | ksun48 | 3452 |
| 9 | Um_nik | 3426 |
| 10 | greenheadstrange | 3393 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 192 |
| 2 | -is-this-fft- | 191 |
| 3 | Monogon | 183 |
| 4 | YouKn0wWho | 182 |
| 5 | Um_nik | 181 |
| 6 | antontrygubO_o | 173 |
| 7 | maroonrk | 168 |
| 8 | errorgorn | 165 |
| 9 | kostka | 164 |
| 9 | SecondThread | 164 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2022 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/28/2022 14:14:43 (f1).
Desktop version, switch to mobile version.
Supported by
