2011年1月5日

POJ 2250 Compromise 最长公共子序列LCS 动态规划DP
摘要： http://poj.org/problem?id=2250最长公共子序列LCS 动态规划DPCompromiseTime Limit:1000MS Memory Limit:65536KSpecial JudgeDescriptionIn a few months the European Currency Union will become a reality. However, to join the club, the Maastricht criteria must be fulfilled, and this is not a trivial task for the countr 阅读全文
posted @ 2011-01-05 14:32 yming0221 阅读(128) 评论(0) 推荐(0)

导航