Блог пользователя Secret.Codes

Автор Secret.Codes, история, 7 лет назад, По-английски

I am a beginner. I know basic of KMP, suffix array. I can also generate prefix function,lcp(longest common prefix) only. Please provide some good problems on them. Please try give mainly DIV 2 C and D type(codeforces is better, but you can give also from any other judge) . Because I am a beginner a solved only 4 or 5 problems of those algorithm. If there are good problems harder than Div2 C or D or any other online judge which should be solved to become better , Give them too I will solve them later.

  • Проголосовать: нравится
  • +6
  • Проголосовать: не нравится

»
7 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

This list of problems may be good place to start although I can't guarantee that they involve only KMP problems:

https://a2oj.com/category?ID=29

Here is a problem I personally solved using KMP:

http://acm.timus.ru/problem.aspx?space=1&num=1423&locale=en

»
5 лет назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Competitive Programming 1 has a bunch of problems on Suffix Array (mostly from UVa OJ).

pdf