I recently came across a problem which required me to learn the Manacher's algorithm.I read it's tutorial on geeks for geeks but could not understand properly,can someone explain me the algorithm a little bit or tell me some other resource for it.
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | 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 |
I recently came across a problem which required me to learn the Manacher's algorithm.I read it's tutorial on geeks for geeks but could not understand properly,can someone explain me the algorithm a little bit or tell me some other resource for it.
Name |
---|
CP algorithm
o thanks for the reply buddy,but i came up with an alternative of this algorithm and Hurrah!! that also works in o(n)