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.
# | 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 |
Name |
---|
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.