Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

Number of distinct substrings for each suffix (prefix) using suffix automaton.

Revision en1, by JuanFernandez, 2019-08-25 21:15:07

I wonder if there's an easy way to solve this problem using suffix automaton. There's a linear solution for this problem using suffix tree (link to a much harder version of a problem).


  Rev. Lang. By When Δ Comment
en1 English JuanFernandez 2019-08-25 21:15:07 305 Initial revision (published)