动态规划
文章平均质量分 64
ibingyu
这个作者很懒,什么都没留下…
展开
-
练习三 Problem P
Problem Description在一无限大的二维平面中,我们做如下假设:1、 每次只能移动一格;2、 不能向后走(假设你的目的地是“向上”,那么你可以向左走,可以向右走,也可以向上走,但是不可以向下走);3、 走过的格子立即塌陷无法再走第二次;求走n步不同的方案数(2种走法只要有一步不一样,即被认为是不同的方案)。原创 2016-05-29 10:17:54 · 345 阅读 · 0 评论 -
练习三 Problem R
Problem DescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). Th原创 2016-05-31 20:25:58 · 399 阅读 · 0 评论 -
练习三 Problem T
Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in a原创 2016-05-31 20:14:08 · 372 阅读 · 0 评论 -
练习三 Problem X
Problem DescriptionRecently, iSea went to an ancient country. For such a long time, it was the most wealthy and powerful kingdom in the world. As a result, the people in this country are still ver原创 2016-05-31 20:04:39 · 307 阅读 · 0 评论 -
练习三 Problem W
Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将在m个学校中选择若干的(当然要在他的经济承受范围内)。每个学校都有不同的申请费用a(万美元),并且Speakless估计了他得原创 2016-05-31 19:34:30 · 353 阅读 · 0 评论 -
练习三 Problem V
Problem DescriptionThe aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to原创 2016-05-29 11:21:21 · 278 阅读 · 0 评论 -
练习三 Problem S
Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002.<br>The splitting is absolutely a big ev原创 2016-05-29 11:19:24 · 295 阅读 · 0 评论 -
练习三 Problem G
Problem Description都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人,所以他只能在小径上接。由于gameboy平时老呆在房间里玩游戏,虽然在游戏中是个身手敏捷的高手,但在现实中运动神经特别迟钝,每秒种只有在移动不超过一米的范围内接住坠落的馅饼。现在给这条小径如图标上原创 2016-05-29 10:57:48 · 336 阅读 · 1 评论 -
练习三 Problem Q
Problem DescriptionMany years ago , in Teddy’s hometown there was a man who was called “Bone Collector”. This man like to collect varies of bones , such as dog’s , cow’s , also he went to the grave …<br>The bone collector had a big bag with a volume of V原创 2016-05-29 10:33:03 · 492 阅读 · 0 评论 -
动态规划总结
不知不觉动态规划这个专题已经开了一个多月了,从平时做题的情况来看学的不怎么扎实,有些问题到现在还转不过弯来,总想着去解决可是一拖再拖一直到了现在还没弄明白。。。。。。说点别的吧,在我看来动态规划就是为了更好的优化问题,将一个大的问题划分为无数个小的问题求最优解,然后再在这些相互关联的解中求所要求的最优解。到现在为止所学的动态规划可以分这么几类吧:有子序列问题,数塔问题,字段和问题,还有就是背包原创 2016-05-31 20:49:09 · 396 阅读 · 0 评论