![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划dp
文章平均质量分 81
cjj97
这个作者很懒,什么都没留下…
展开
-
HDU-1176-免费馅饼
点击打开链接免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51528 Accepted Submission(s): 17995Problem Descript原创 2017-08-09 17:42:32 · 182 阅读 · 0 评论 -
HDU-1257-最少拦截系统
点击打开链接最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 44667 Accepted Submission(s): 17501Problem Description某原创 2017-08-09 18:01:09 · 218 阅读 · 0 评论 -
HDU-1069-Monkey and Banana
点击打开链接Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16010 Accepted Submission(s): 8495Problem Descri原创 2017-08-09 19:59:31 · 177 阅读 · 0 评论 -
HDU-1087-Super Jumping! Jumping! Jumping!
点击打开链接Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40458 Accepted Submission(s): 18691原创 2017-08-09 20:04:20 · 159 阅读 · 0 评论 -
矩阵取数
矩阵取数一个N*N矩阵中有不同的正整数,经过这个格子,就能获得相应价值的奖励,从左上走到右下,只能向下向右走,求能够获得的最大价值。例如:3 * 3的方格。1 3 32 1 32 2 1能够获得的最大价值为:11。题解:对于dp[i][j]有三种情况1.dp[1][1]==map[1][1];2.出界初始为负无穷;3.其他dp[i][j]=max原创 2017-08-09 17:55:43 · 570 阅读 · 0 评论