algorithms.tutorialhorizon.com
Dynamic Programming - Longest Increasing Subsequence | Algorithms
Given a array A[1,2,......,n] , calculate B[1,2....m] with B[i]