随笔分类 -  动态规划（DP）

上一页 1 2 3 4
HDU 2059 龟兔赛跑
摘要：龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7739Accepted Submission(s): 2977 Problem Description据说在很久很久以前，可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后，心中郁闷，发誓要报仇雪恨，于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼，终于练成了绝技，能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟，以雪前耻。 最近正值HDU举办50周年校庆 阅读全文
posted @ 2013-03-26 17:50 Jack Ge 阅读(582) 评论(1) 推荐(0)
HDU 1078 FatMouse and Cheese (DFS+DP)
摘要：FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3194Accepted Submission(s): 1253 Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is lab 阅读全文
posted @ 2013-03-26 16:43 Jack Ge 阅读(249) 评论(0) 推荐(0)
HDU 1025 Constructing Roads In JGShining's Kingdom (DP+二分)
摘要：Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10441Accepted Submission(s): 2990 Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in t 阅读全文
posted @ 2013-03-26 16:10 Jack Ge 阅读(460) 评论(0) 推荐(0)
HDU 1160 FatMouse's Speed
摘要：FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6276Accepted Submission(s): 2735 Special JudgeProblem DescriptionFatMouse believes that the fatter a mouse is, the faster it runs. To disprove this, you want to take the data on a 阅读全文
posted @ 2013-03-26 15:48 Jack Ge 阅读(1227) 评论(0) 推荐(0)
HDU 1978 How many ways
摘要：How many waysTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1654Accepted Submission(s): 1016 Problem Description这是一个简单的生存游戏，你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下： 1.机器人一开始在棋盘的起始点并有起始点所标有的能量。 2.机器人只能向右或者向下走，并且每走一步消耗一单位能量。 3.机器人不能在原地停留。 4.当机 阅读全文
posted @ 2013-03-26 14:09 Jack Ge 阅读(241) 评论(0) 推荐(0)
HDU 2870 Largest Submatrix
摘要：Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 839Accepted Submission(s): 407 Problem DescriptionNow here is a matrix with letter 'a','b','c','w','x','y','z' and you can cha 阅读全文
posted @ 2013-03-25 14:21 Jack Ge 阅读(365) 评论(0) 推荐(0)
HDU 2845 Beans
摘要：BeansTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1819Accepted Submission(s): 921 Problem DescriptionBean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one be 阅读全文
posted @ 2013-03-24 22:56 Jack Ge 阅读(246) 评论(0) 推荐(0)
HDU 2844 Coins (多重背包)
摘要：CoinsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4071Accepted Submission(s): 1629 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 d 阅读全文
posted @ 2013-03-24 13:22 Jack Ge 阅读(472) 评论(0) 推荐(1)
HDU 3006 The Number of set (状态压缩)
摘要：The Number of setTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 889Accepted Submission(s): 550 Problem DescriptionGiven you n sets.All positive integers in sets are not less than 1 and not greater than m.If use these sets to combinate the new set 阅读全文
posted @ 2013-03-24 12:37 Jack Ge 阅读(226) 评论(0) 推荐(0)
HDU 最大报销额 (0 1 背包)
摘要：最大报销额Time Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 29Accepted Submission(s) : 11Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书（A类）、文具（B类）、差旅（C类），要求每张发票的总额不得超过1000元，每张发票上，单项物品的价值不得超过600元。现请你编写程序，在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。Input测试输入包含若干测试用例 阅读全文
posted @ 2013-03-22 16:47 Jack Ge 阅读(235) 评论(0) 推荐(0)
HDU 4389 X mod f(x) (数位DP）
摘要：X mod f(x)Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1014Accepted Submission(s): 453 Problem DescriptionHere is a function f(x): int f ( int x ) { if ( x == 0 ) return 0; return f ( x / 10 ) + x % 10; } Now, you want to ... 阅读全文
posted @ 2013-03-22 08:04 Jack Ge 阅读(1163) 评论(0) 推荐(0)
HDU 威威猫系列故事——篮球梦
摘要：威威猫系列故事——篮球梦Time Limit: 300/100 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 774Accepted Submission(s): 200 Problem Description 威威猫十分迷恋篮球比赛，是忠实的NBA球迷，他常常幻想自己那肥硕的身躯也能飞起扣篮。另外，他对篮球教练工作也情有独钟，特别是对比赛的战术，投篮选择方面也是很有研究，下面就是威威猫研究过的一个问题： 一场NBA篮球比赛总共48分钟，假如我们现在已经知道当前比分 A:B，... 阅读全文
posted @ 2013-03-21 22:47 Jack Ge 阅读(519) 评论(0) 推荐(0)
HDU Big Event in HDU
摘要：Big Event in HDUTime Limit: 1000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1Accepted Submission(s): 1Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever 阅读全文
posted @ 2013-03-17 12:39 Jack Ge 阅读(487) 评论(0) 推荐(0)
POJ 1661 Help Jimmy
摘要：Help JimmyTime Limit:1000MSMemory Limit:10000KTotal Submissions:7701Accepted:2447Description"Help Jimmy" 是在下图所示的场景上完成的游戏。场景中包括多个长度和高度各不相同的平台。地面是最低的平台，高度为零，长度无限。Jimmy老鼠在时刻0从高于所有平台的某处开始下落，它的下落速度始终为1米/秒。当Jimmy落到某个平台上时，游戏者选择让它向左还是向右跑，它跑动的速度也是1米/秒。当Jimmy跑到平台的边缘时，开始继续下落。Jimmy每次下落的高度不能超过MAX米，不然就会 阅读全文
posted @ 2013-03-05 18:20 Jack Ge 阅读(370) 评论(0) 推荐(0)
POJ 3628 Bookshelf 2
摘要：Bookshelf 2http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1002&ojid=1&cid=2967&hide=0Time Limit : 2000/1000ms (Java/Other)Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 76Accepted Submission(s) : 37Problem DescriptionFarmer John recently bought another books 阅读全文
posted @ 2013-03-02 08:13 Jack Ge 阅读(583) 评论(0) 推荐(1)
POJ 1015 Jury Compromise
摘要：Jury Compromisehttp://poj.org/problem?id=1015Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 22094Accepted: 5670Special JudgeDescriptionIn Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is se 阅读全文
posted @ 2013-01-09 15:48 Jack Ge 阅读(372) 评论(0) 推荐(0)
POJ 2479 Maximum sum （双向DP）
摘要：Maximum sumhttp://poj.org/problem?id=2479Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 28485Accepted: 8713DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:Your task is to calculate d(A).InputThe input consists of T(#include#includeusing namespac 阅读全文
posted @ 2013-01-09 09:39 Jack Ge 阅读(322) 评论(0) 推荐(0)
HDU 1503 Advanced Fruits （最长公共子序列）
摘要：Advanced Fruitshttp://acm.hdu.edu.cn/showproblem.php?pid=1503Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 977 Accepted Submission(s): 466Special JudgeProblem DescriptionThe company "21st Century Fruits" has specialized in creating new 阅读全文
posted @ 2013-01-05 21:27 Jack Ge 阅读(445) 评论(0) 推荐(0)
HDU 3664 Permutation Counting
摘要：Permutation Countinghttp://acm.hdu.edu.cn/showproblem.php?pid=3664Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1001 Accepted Submission(s): 496 Problem DescriptionGiven a permutation a1, a2, … aN of {1, 2, …, N}, we define its E-value as the a 阅读全文
posted @ 2012-12-29 22:39 Jack Ge 阅读(233) 评论(0) 推荐(0)

上一页 1 2 3 4