p[i] maintains previous index from which b[i] has reached longest sequence
till i.
to get the actual list of non-decrease sequence, p has to be traversed
through back indices
for (u = b.size(), v = b.back(); u--; v = p[v]) b[u] = v;
surender
On Sat, Jul 16, 2011 at 9:06 AM, Neeraj Gupta
Hi
Can anyone help me in understanding the following code
http://www.algorithmist.com/index.php/Longest_Increasing_Subsequence.cpp
I am not able to understand what is the exact purpose of vector p in the
above mentioned code.
A little detail explanation will be helpful.
I have already
