Can this problem be solved using Suffix Automaton? I want to know if we can solve this using this algorithm. Can anyone please share any ideas? Thanks in advance :)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
Can this problem be solved using Suffix Automaton? I want to know if we can solve this using this algorithm. Can anyone please share any ideas? Thanks in advance :)
Name |
---|
Actually it's a problem on KMP algorithm...
I have already solved using KMP & DFS. But i want to know if it has any idea on SAM.
You don't even need suffix automata, I think you can do it in O(N) just with tree DFS and kmp :)
I have already solved using KMP & DFS. But i want to know if it has any idea on SAM.