2014年2月25日
HDU-2602 Bone Collector
摘要： http://acm.hdu.edu.cn/showproblem.php?pid=260201背包：用二维数组实现。c[n][m]表示n种物品，背包容量为m的最大价值。状态方程为:f(n,m)=max{f(n-1,m), f(n-1,m-w[n])+P(n,m)}这就是书本上写的动态规划方程. Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 24513Accepted Submission(s): 9911 Pr 阅读全文
posted @ 2014-02-25 21:10 疯狂的癫子 阅读(198) 评论(0) 推荐(0) 编辑
HDU-1505 City Game
摘要： http://acm.hdu.edu.cn/showproblem.php?pid=15051506的加强，从一维变二维。 City GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3959Accepted Submission(s): 1651 Problem DescriptionBob is a strategy game programming specialist. In his new city building game 阅读全文
posted @ 2014-02-25 16:43 疯狂的癫子 阅读(131) 评论(0) 推荐(0) 编辑