I need help in finding Longest Increasing Sub-sequence in minimum Time complexity.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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