I have wrote an O(n^2) solution for this problem
http://www.spoj.com/problems/STRSOCU/
here is my code
What could be a better Solution for it?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I have wrote an O(n^2) solution for this problem
http://www.spoj.com/problems/STRSOCU/
here is my code
What could be a better Solution for it?
Name |
---|
I tried to optimize it a little bit and write it in C++ but it also gives TLE http://ideone.com/fb4hv5 I do not concatenate n times but i give the Z-function a number k to start matching from the character at index k It works correctly and the Z-values are correct but the time is too much
This is the latest thing I did
I think I can't optimize more in an O(n^2) code
http://ideone.com/9OzGGX
O(n) solution with suffix automaton: 2bc3OA
Thank you so much. I haven't heard about this data structure before. Time to learn a new data structure. If you have some links that will make me understand it faster provide me with it please.
http://e-maxx.ru/algo/suffix_automata
but it's Russian :(