Multiple Queries/String Matching

Правка en1, от Hepic_Antony_Skarlatos, 2016-07-04 17:40:25

What is the most efficient algorithm when the problem gives you a string of N length and asks you to answer in Q queries if the ith word of length M (where M is much lesser than N -> M << N) is contained into 'N length word' ?

Thanks in advance !


  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Hepic_Antony_Skarlatos 2016-07-04 17:40:25 281 Initial revision (published)