Problem

Правка en1, от X-O__O-X, 2020-11-22 07:31:54

Given integers n and k such that

0 < n <= 10^6

0 < k <= 10^3

and a string S of length n.

Find any substring of length k in S with maximum number of occurrences. I don't care about the obvious complete search solution.

example

n=10 k=3

abcabcabcd

ans is "abc" repeated 3 times.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский X-O__O-X 2020-11-22 07:35:22 83
en2 Английский X-O__O-X 2020-11-22 07:33:26 8
en1 Английский X-O__O-X 2020-11-22 07:31:54 313 Initial revision (published)