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