摘要:
Longest Ordered SubsequenceTime Limit:2000MSMemory Limit:65536KTotal Submissions:24010Accepted:10407DescriptionA numeric sequence ofaiis ordered ifa1<a2< ... <aN. Let the subsequence of the given numeric sequence (a1,a2, ...,aN) be any sequence (ai1,ai2, ...,aiK), where 1 <=i1<i2< 阅读全文
posted @ 2012-08-19 22:49
Eric-Yang
阅读(206)
评论(0)
推荐(0)