i just learnt kmp and its pog! way better than 0-1 knapsack.but the problem is idk the implementation in c++.can somebody give me 1?
№ | Пользователь | Рейтинг |
---|---|---|
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 |
2 | maomao90 | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
can someone give exmaple of kmp algorithm implementation
i just learnt kmp and its pog! way better than 0-1 knapsack.but the problem is idk the implementation in c++.can somebody give me 1?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | mac_n_cheese_pog | 2021-11-12 09:40:01 | 2 | |||
en1 | mac_n_cheese_pog | 2021-11-12 09:39:27 | 188 | Initial revision (published) |
Название |
---|