2011年8月3日

HDU Common Subsequence

摘要： Common SubsequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 182 Accepted Submission(s): 109 Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, 阅读全文

posted @ 2011-08-03 10:01 NewPanderKing 阅读(374) 评论(0) 推荐(0) 编辑

HDU Max Sum

摘要： Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 191 Accepted Submission(s): 98 Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max 阅读全文

posted @ 2011-08-03 09:59 NewPanderKing 阅读(387) 评论(0) 推荐(0) 编辑

HDU 数塔

摘要： 数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 106 Accepted Submission(s): 94 Problem Description在讲述DP算法的时候，一个经典的例子就是数塔问题，它是这样描述的：有如下所示的数塔，要求从顶层走到底层，若每一步只能走到相邻的结点，则经过的结点的数字之和最大是多少？已经告诉你了，这是个DP的题目，你能AC吗?Input输入数据首先包括一个整数C,表示测试实例的个数，每个测试实例的第一行是一 阅读全文

posted @ 2011-08-03 09:58 NewPanderKing 阅读(219) 评论(0) 推荐(0) 编辑

导航