Add solution for UVA problem 481 What Goes Up
Dynamic Programming - Longest Increasing Subsequence
O(n ^ 2) is not good enough, we must apply O(n log n) algorithm to solve
the problem