poj 2533 Longest Ordered Subsequence (最长不下降子序列)
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 N.
For example, sequen
原创
2017-02-20 19:56:22 ·
206 阅读 ·
0 评论