I found a SAM solution on luogu, but it is too hard for me to learn SAM, I wonder if there exists a solution without SAM.
Problem statement
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Can this problem be solved without SAM ?
I found a SAM solution on luogu, but it is too hard for me to learn SAM, I wonder if there exists a solution without SAM.
We called string $$$t$$$ a Quasi-template of string $$$s$$$, if and only if $$$t$$$ is a substring of $$$s$$$ and there exists at least one pair of integers $$$(l,r)$$$ satisfying:
Given string $$$s$$$, you need to find:
$$$1 \le |s| \le 2 \cdot 10^5$$$.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | little_dog | 2024-03-23 11:57:32 | 132 | |||
en1 | little_dog | 2024-03-22 09:32:31 | 983 | Initial revision (published) |
Name |
---|