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

Правка en1, от sidereal, 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. Язык Кто Когда Δ Комментарий
en1 Английский sidereal 2019-08-25 21:15:07 305 Initial revision (published)