|
|
вернуться в форумAC :) (+) You should build a trie, which to store the word. 1.Build the trie in reverse order 2.Make suffix links in BFS order. 3.Process the text But my algo must read the text in reverse order,so it has to use more 2000K :( Otherwise, 1500K is enough. Re: AC :) (+) How many vertex did you use in your tree? Re: AC :) (+) maxn? I have got ML 7! Re: AC :) (+) Послано cactus 13 июл 2007 16:39 Me,too! -_-b Re: AC :) (+) Послано cactus 14 июл 2007 14:42 Now I've solved it. We can only record the char on the node, not the pointer. |
|
|