Dynamic Programming

Longest increasing subsequence - Dynamic Programming
An increasing subsequence is a subset { a_i1,a_i2,...,a_ik } of a larger sequence of numbers { a₁, a₂, .... , a_n }, such that (a) 1 <= i₁ < i₂ < .... < i_k <= n, and (b) a_i1 < a_i2 < .... < a_ik.
Read more...

---