Longest Repeat

Difficulty: 2100 6000 ms 128 MB

strings suffix-array

Print the length of the longest substring that occurs at least TWICE in S (overlaps allowed).

Input: one line with the string S.

Output: the longest repeated-substring length (0 if none).

Constraints:

• 1 ≤ |S| ≤ 10⁵
• lowercase letters

Sample Tests

banana

3

abcd

0

Read the Editorial