This was used in my solving of SPOJ 11110. Easy Longest Increasing Subsequence ELIS and is in git and below:

# Longest Increasing Subsequence

The following is a dynamic programming implementation to find the longest increasing subsequence (Wikipedia). It runs in time .