![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
lishuhuakai
这个作者很懒,什么都没留下…
展开
-
杭电1081——to the max(动态规划和暴力法解)
To The MaxProblem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole原创 2012-11-03 00:27:11 · 3357 阅读 · 0 评论 -
杭电OJ——1024 Max Sum Plus Plus(另类的动态规划!)
Max Sum Plus PlusProblem DescriptionNow I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you a原创 2012-10-13 15:13:51 · 9599 阅读 · 5 评论 -
杭电OJ——1069 Monkey and Banana(动态规划!)
Monkey and BananaProblem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time,原创 2012-10-11 14:59:42 · 5161 阅读 · 1 评论 -
通过金矿模型介绍动态规划
对于动态规划,每个刚接触的人都需要一段时间来理解,特别是第一次接触的时候总是想不通为什么这种方法可行,这篇文章就是为了帮助大家理解动态规划,并通过讲解基本的01背包问题来引导读者如何去思考动态规划。本文力求通俗易懂,无异性,不让读者感到迷惑,引导读者去思考,所以如果你在阅读中发现有不通顺的地方,让你产生错误理解的地方,让你难得读懂的地方,请跟贴指出,谢谢! ----第一节转载 2013-06-26 06:38:58 · 1584 阅读 · 0 评论 -
杭电OJ -- 2084 数塔(动态规划)
Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个DP的题目,你能AC吗? Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1原创 2015-09-28 09:06:33 · 1437 阅读 · 0 评论 -
杭电OJ——1025 Constructing Roads In JGShining's Kingdom(比较有趣的一道题目,思路详解)
Constructing Roads In JGShining's KingdomProblem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of the原创 2012-11-10 01:48:30 · 3889 阅读 · 0 评论