2015年1月15日

POJ 2250 Compromise（最长公共子序列）

摘要： CompromiseTime Limit:1000MSMemory Limit:65536KTotal Submissions:6654Accepted:2976Special JudgeDescriptionIn a few months the European Currency Union w... 阅读全文

posted @ 2015-01-15 15:39 TopCoder 阅读(158) 评论(0) 推荐(0)

HDU 4512 吉哥系列故事——完美队形I（回文字符串的长度）

摘要： 吉哥系列故事——完美队形ITime Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2186Accepted Submission(s): 696Proble... 阅读全文

posted @ 2015-01-15 15:37 TopCoder 阅读(145) 评论(0) 推荐(0)

POJ 2533 Longest Ordered Subsequence（单调递增子序列）

摘要： Longest Ordered SubsequenceTime Limit:2000MSMemory Limit:65536KTotal Submissions:35037Accepted:15372DescriptionA numeric sequence ofaiis ordered ifa11... 阅读全文

posted @ 2015-01-15 14:56 TopCoder 阅读(121) 评论(0) 推荐(0)

POJ 1159 Palindrome（回文字符串）

摘要： PalindromeTime Limit:3000MSMemory Limit:65536KTotal Submissions:54047Accepted:18672DescriptionA palindrome is a symmetrical string, that is, a string ... 阅读全文

posted @ 2015-01-15 14:34 TopCoder 阅读(168) 评论(0) 推荐(0)

POJ-1458 Common Subsequence （最长公共子序列）

摘要： Common SubsequenceTime Limit:1000MSMemory Limit:10000KTotal Submissions:39851Accepted:16030DescriptionA subsequence of a given sequence is the given s... 阅读全文

posted @ 2015-01-15 11:25 TopCoder 阅读(186) 评论(0) 推荐(0)

POJ-2593 Max Sequence（不连续的最大子段和）

摘要： Max SequenceTime Limit:3000MSMemory Limit:65536KTotal Submissions:16001Accepted:6715DescriptionGive you N integers a1, a2 ... aN (|ai| 2 int main() 3... 阅读全文

posted @ 2015-01-15 11:06 TopCoder 阅读(173) 评论(0) 推荐(0)

POJ-2479 Maximum sum （不连续的最大子段和）

摘要： Maximum sumTime Limit:1000MSMemory Limit:65536KTotal Submissions:34398Accepted:10661DescriptionGiven a set of n integers: A={a1, a2,..., an}, we defin... 阅读全文

posted @ 2015-01-15 10:39 TopCoder 阅读(253) 评论(0) 推荐(0)

导航