I need help in finding Longest Increasing Sub-sequence in minimum Time complexity.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 149 |
6 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
I need help in finding Longest Increasing Sub-sequence in minimum Time complexity.
Название |
---|
Auto comment: topic has been updated by sagarsingla_ (previous revision, new revision, compare).
https://cp-algorithms.com/sequences/longest_increasing_subsequence.html
Did you find any?
The minimal possible complexity is $$$O(n\log \log \text{LIS})$$$. But it's very hard (van Emde Boas trees). The optimal complexity for CP is $$$O(n\log n)$$$.
P. S. https://hal-upec-upem.archives-ouvertes.fr/hal-00620279