LIS(最长增长子串):The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous, or unique.
http://en.wikipedia.org/wiki/Longest_increasing_subsequence
http://blog.csdn.net/linulysses/article/details/5559262