CF 105201F - Further Exotic Algorithm (Hard Version)
We are given a string and we turn it into a graph whose vertices are the positions of the string. Between any two positions $i$ and $j$, we draw an edge if the substring from $i$ to $j$ reads the same f
CF 105201F - Further Exotic Algorithm (Hard Version)
Rating: -
Tags: -
Solve time: 35s
Verified: no
Solution
Problem Understanding
We are given a string and we turn it into a graph whose vertices are the positions of the string. Between any two positions $i$ and $j$, we draw an edge if the substring from $i$ to $j$ reads the same f