![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划(dp)
文章平均质量分 93
wyc_
技术之路是千里之行,莫功利方能行更远
展开
-
HDU1003 Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 149471 Accepted Submission(s): 34914Problem DescriptionGiven a sequence a[1],a[2],a原创 2014-10-23 09:54:19 · 376 阅读 · 0 评论 -
HDU4960 Another OCD Patient
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1147 Accepted Submission(s): 409Problem DescriptionXiaoji is an OCD (obsessive-原创 2014-11-06 10:50:39 · 594 阅读 · 0 评论 -
HDU4901 The Romantic Hero
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1415 Accepted Submission(s): 599Problem DescriptionThere is an old country and th原创 2014-11-06 16:30:55 · 309 阅读 · 0 评论 -
HDU Clear All of Them I(状态压缩+DP+记忆搜索)
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 122768/62768 K (Java/Others)Total Submission(s): 1556 Accepted Submission(s): 509Problem DescriptionAcmers have been the Earth Prot原创 2014-11-09 19:44:55 · 381 阅读 · 0 评论 -
三维动态规划 To The Max
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8503 Accepted Submission(s): 4127Problem DescriptionGiven a two-dimensional array原创 2014-11-22 18:05:16 · 2227 阅读 · 0 评论 -
动态规划专题(I)
动态规划与分治法类似,都是通过组合子问题的解来求解原问题。分治方法将问题划分为互不相交的子问题,递归的求解子问题,再将它们组合起来,求出原问题的解。与之相反,动态规划应用于子问题重叠的情况,不同的子问题具有公共的子子问题。这个时候,分治算法会做许多不必要的工作,它会反复的求解那些公共子子问题,而动态规划则对每个子问题只求解一次。举例来说,在之前的文章《排序算法总结》中,我们介绍了一些采用分治策略的原创 2014-11-19 10:36:13 · 618 阅读 · 0 评论 -
多源最短路径--Floyd-Warshall算法
上一篇文章《所有节点对的最短路径问题》中我们介绍到了Floyd-Warshall算法,由于代码较长,没有放到上一篇文章中,我们在这里单独给出Java实现的代码。 import java.util.*; class Floyd_Warshall { static final int MAX = 20; //最大点数 s原创 2015-01-21 21:06:05 · 543 阅读 · 0 评论 -
动态规划专题(III)
接上一篇11. Minimum Path SumGiven a m x n grid filled with non-negative numbers, find a path from top left to bottom right whichminimizes the sum of all numbers along its path.Note: You can on原创 2014-11-19 17:20:10 · 889 阅读 · 0 评论 -
动态规划专题(II)
1.钢条切割问题长度i 1 2 3 4 5 6 7 8原创 2014-11-19 10:37:47 · 608 阅读 · 0 评论