Add a O(n log k) solution for the Longest Increasing Subsequence problem