|
|
вернуться в форумПоказать все сообщения Спрятать все сообщенияI've got AC constructing suffix tree (mcc algo). Now, who also has O(N) solution simplier than mine, please tell me your idea. And is O(N*N) anough to get AC? Thanks. Oh, yes. How stupid I was. Thanks a lot. Now I have AC with kmp) I've got AC constructing suffix tree (mcc algo). Now, who also has O(N) solution simplier than mine, please tell me your idea. And is O(N*N) anough to get AC? Thanks. yes. It is a little strange, but O(n^2) really gets AC How to solve this problem using KMP? Somthing with prefix function or what? Help me pls, 'cause I solved this only with O(n^2). |
|
|