Solve 2-3_longest-increasing-subsequence with a O(n log n) algorithm.