无序数组的最大有序序列

Search for the longest ordered array from a disordered array

从现实世界的游戏规则出发,讨论在不打破原向量本身次序的基础上寻求一个最大的有序序列的算法问题(可能同时存在多个增序(或降序)序列，但本文讨论增序问题)．

The internal sorting is the scriptural algorithm. A lot of experts have made their efforts and contribution to it, for example: scriptural sort, shells method, and so on. However, it requires braking the original order of the array in order to search for an order array in the path, in contrast. The article discusses the theme which searches for the longest ordered array based on not braking the original array's order (it may exist several queue decreases or increase orders, the article discusses the increase order.).