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 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
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.