Can someone explain how do to get the array of LIS , that is the dp[] array we normally get in LIS using n^2 algo. using nlogn algo. that is patience sort ? Thanks.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Название |
---|
I think I did not make it clear:
dp[i] is the array of LIS lengths starting at ith element.
(starting means the first element of the LIS is a[i])
http://ideone.com/tHksB
it stores the longest decreasing subsequences's length from backwards.
It can be modified to find LIS also i guess.
Your is itself a longest increasing sequence.
But My dp[] is actually , the " lengths " of LIS ,
your d[] and my vec are same thing.
But I wanted the dp[].
Thanks for trying to help, but my doubt is clear now.
Thanks again.