any idea what could be my mistake? i'm using
i=n; i< 2n; i++
h2=((mod + h2 - dn * a[i-n] % mod) * d % mod + a[i]) % mod;

where d=256, dn=d^(n-1) mod=10^9+9

i had WA8 with hashes, i had maxn = 250100, but it must be doubled for algo and it passed with 500100

Boyer-Moor algorithm gets TL6 - it works slower than naive substrings search!
AC with KMP

Definately hashes are faster than other algo's. I also implemented using hased and was able to solve this string problem.
http://www.techcrashcourse.com/2015/05/c-programming-strings.html
http://www.techcrashcourse.com/2014/10/c-program-find-string-length.html
http://www.techcrashcourse.com/2014/10/c-program-find-palindrome-string.html


Edited by author 05.04.2017 22:22