说明：  设计一个O(n n)时间的算法,找出由n个数组成的序列的最长单调递增子序列
(An algorithm of O (n n) time is designed to find the longest monotone increasing subsequence of the sequence composed of n number.)