2013年7月17日
hdu 1978 How many ways 记忆化搜索 经典例题
摘要： How many waysTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1869Accepted Submission(s): 1144Problem Description这是一个简单的生存游戏，你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下：1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走，并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一 阅读全文
posted @ 2013-07-17 19:20 芷水 阅读(313) 评论(0) 推荐(0) 编辑
hdu 1078 FatMouse and Cheese 记忆化搜索
摘要： FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3521Accepted Submission(s): 1394Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is label 阅读全文
posted @ 2013-07-17 19:16 芷水 阅读(300) 评论(0) 推荐(0) 编辑
hdu 1258 Sum It Up
摘要： Sum It UpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2906Accepted Submission(s): 1455Problem DescriptionGiven a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4 阅读全文
posted @ 2013-07-17 07:56 芷水 阅读(157) 评论(0) 推荐(0) 编辑