上升子序列 - 随笔分类 - hebozi

poj 2533 Longest Ordered Subsequence

摘要：Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 24375Accepted: 10596DescriptionA 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 < 阅读全文

posted @ 2012-10-15 21:22 hebozi 阅读(158) 评论(0) 推荐(0)

随笔分类 - 上升子序列