07 2012 档案

poj2533 最长升序子序列解题报告
摘要：Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 23388Accepted: 10113DescriptionA 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-07-21 11:16 Blue-Sea 阅读(120) 评论(2) 推荐(0)

导航