01 2016 档案

POJ-2533最长上升子序列(DP+二分）（优化版）
摘要：Longest Ordered SubsequenceTime Limit:2000MSMemory Limit:65536KTotal Submissions:41944Accepted:18453DescriptionA numeric sequence ofaiis ordered ifa1#... 阅读全文
posted @ 2016-01-16 22:16 JoneZP 阅读(687) 评论(0) 推荐(0)
POJ-2955括号匹配问题（区间DP）
摘要：BracketsTime Limit:1000MSMemory Limit:65536KTotal Submissions:4834Accepted:2574DescriptionWe give the following inductive definition of a “regular bra... 阅读全文
posted @ 2016-01-15 16:19 JoneZP 阅读(300) 评论(0) 推荐(0)