Please explain how to solve this problem. https://cses.fi/problemset/task/1110
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Please explain how to solve this problem. https://cses.fi/problemset/task/1110
Name |
---|
https://cp-algorithms.com/string/lyndon_factorization.html
Try with Booth's Algorithm
[C++ CODE] (https://github.com/marianoferesin/Programacion-Competitiva/blob/main/Strings/Booth%20Algorithm%20(Minimal%20Lexicographical%20String%20Rotation).cpp)
this problem is asking the same thing as "implement a suffix array". but an nlogn suffix array will tle, so you can copy and paste a linear suffix array and get ac.
here is the linear suffix array
would you please give the code again link doesn't work
click