You are given a sequence of numbers and you need to find a longest increasing subsequence from the given input(not necessary continuous).
I found the link to this(Lo
One of the best explanation to this problem is given by MIT site. http://people.csail.mit.edu/bdean/6.046/dp/
I hope it will clear all your doubts.