
The longest nondecreasing sequence example discussed in this tutorial http://www.topcoder.com/tc?module=Static&d1=tutorials&d2=dynProg ends with a table which has 3 columns. The last column being the "The last sequence i from which we "arrived" to this one". In the last row the table when i = 6, this column has value 4 which means that we have arrived at this from the sequence when i was 4, which is when the sequence was 3,4,8. I might be wrong but in my opinion, but we have arrived at the last entry (column 3 and i = 6) from when i = 5 ie. when we had two longest nondecreasing sequences 3,4,8 and 3,4,6. Shud the entry in this spot not be 5, instead of 4. Pls correct me if I am wrong. 