2013年1月24日
hdu 1565 方格取数(1)(DP 状态压缩)
摘要： 方格取数(1)Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2585 Accepted Submission(s): 976Problem Description给你一个n*n的格子的棋盘，每个格子里面有一个非负数。从中取出若干个数，使得任意的两个数所在的格子没有公共边，就是说所取的数所在的2个格子不能相邻，并且取出的数的和最大。Input包括多个测试实例，每个测试实例包括一个整数n 和n*n个非负数(n #include #includ 阅读全文
posted @ 2013-01-24 15:54 剑不飞 阅读(198) 评论(0) 推荐(0) 编辑
hdu 1121 Complete the Sequence(DP多项式差分)
摘要： Complete the SequenceTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 161 Accepted Submission(s): 93Problem DescriptionYou probably know those quizzes in Sunday magazines: given the sequence 1, 2, 3, 4, 5, what is the next number? Sometimes it is v 阅读全文
posted @ 2013-01-24 13:31 剑不飞 阅读(401) 评论(0) 推荐(0) 编辑
hdu 1114 Piggy-Bank（DP背包）
摘要： Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6244 Accepted Submission(s): 3137Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes 阅读全文
posted @ 2013-01-24 12:25 剑不飞 阅读(139) 评论(0) 推荐(0) 编辑