Longest Ordered Subsequence (最长上升子序列)
Description
A numeric sequence of ai is ordered if a1 a2 aN. Let the subsequence of the
given numeric sequence ( a1, a2, ..., aN) be any sequence ( ai1, ai2,
..., aiK), where 1 i1 i2 iK
原创
2015-02-06 14:07:05 ·
294 阅读 ·
0 评论