|
|
вернуться в форумsuffix automata Could anyone tell me how to solve this task using suffix automata?? Re: suffix automata I have already found a way to solve this problem using suffix automata, solution would yield to an O(n^2) time, it's just a simple calculation. KMP also works efficiently here. |
|
|