I am learning the alogorithm of prefix_function i get the algorithm but unable to understand the time complexity of the algorithm why the time complexity is o(n) can anyone explain the time complexity of algo.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
time complexity of lps
I am learning the alogorithm of prefix_function i get the algorithm but unable to understand the time complexity of the algorithm why the time complexity is o(n) can anyone explain the time complexity of algo.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | striker_46 | 2024-05-02 23:37:42 | 234 | Initial revision (published) |
Название |
---|