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
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | little_dog | 2024-03-23 11:57:32 | 132 | |||
en1 | little_dog | 2024-03-22 09:32:31 | 983 | Initial revision (published) |
Название |
---|