I need help in finding Longest Increasing Sub-sequence in minimum Time complexity.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 160 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
I need help in finding Longest Increasing Sub-sequence in minimum Time complexity.
Name |
---|
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