摘要: 数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16321Accepted Submission(s): 9800Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个DP的题目,你能AC吗?Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一 阅读全文
posted @ 2013-08-22 21:09 Snail。 阅读(1411) 评论(0) 推荐(0) 编辑
摘要: B -Big NumberTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to 阅读全文
posted @ 2013-08-22 14:11 Snail。 阅读(142) 评论(0) 推荐(0) 编辑