含有n个int型数的数组中删去若干个成分，使剩下的全部成分构成一个不减的子序列,求数组的不减子序列的长-Contains the number of n-type array of int to delete a number of elements, and thus all the remaining ingredients to form a diminished sub-sequence of the diminished demand an array of long sub-sequence of