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 ?
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3783 |
| 2 | jiangly | 3710 |
| 3 | tourist | 3662 |
| 4 | Um_nik | 3526 |
| 5 | ko_osaga | 3500 |
| 6 | maroonrk | 3488 |
| 7 | ecnerwala | 3478 |
| 8 | inaFSTream | 3477 |
| 9 | fantasy | 3470 |
| 10 | QAQAutoMaton | 3428 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 185 |
| 2 | adamant | 177 |
| 2 | awoo | 177 |
| 4 | nor | 169 |
| 5 | maroonrk | 165 |
| 6 | -is-this-fft- | 164 |
| 7 | antontrygubO_o | 155 |
| 8 | ko_osaga | 151 |
| 8 | dario2994 | 151 |
| 10 | SecondThread | 148 |
→ Find user
→ Recent actions
I was trying to solve this problem on UVA : https://uva.onlinejudge.org/index.php?option=onlinejudge&Itemid=8&page=show_problem&problem=3133 I have solved a similar problem with smaller constraint using dp+bitmask. Can anyone suggest some approach or link some similar problems.
Codeforces (c) Copyright 2010-2023 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/29/2023 02:40:47 (l1).
Desktop version, switch to mobile version.
Supported by
