|
|
вернуться в форумПоказать все сообщения Спрятать все сообщенияI have a good hash function (I think), but i don`t know how to store the hash codes for fast access. please help Edited by author 12.07.2009 06:39 Use an array of hashes of all preffix of the string!
use hash table... it's simple and fast. AC KALO 26 янв 2010 01:26 Finally I managed to get AC with O(n^2logn) suffix array. Re: AC Baurzhan 26 янв 2010 11:44 This problem can be solved with prefix-function in O(N^2) and sizeof(bool)*5000*5000 memory. |
|
|