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?
# | User | Rating |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
# | User | Contrib. |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|