HDU__
ACMer_Shadow
Just Going!! 2016年6月6日开始学习Java!学有余力,刷ACM题!
展开
-
HDU 1004 Let the Balloon Rise【水题】
Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 102886 Accepted Submission(s): 39491Problem DescriptionContes原创 2016-05-10 21:13:37 · 458 阅读 · 0 评论 -
HDU 2102 A计划【BFS广搜】
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16970 Accepted Submission(s): 4273Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们原创 2016-07-21 11:13:13 · 1034 阅读 · 0 评论 -
HDU 2612 Find a way【第一次双BFS】
Find a wayTime Limit : 3000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 15 Accepted Submission(s) : 5Font: Times New Roman | Verdana | Georgia原创 2016-07-18 20:53:48 · 9263 阅读 · 0 评论 -
HDU 2717 Catch That Cow【BFS】
Catch That CowTime Limit : 5000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 4Font: Times New Roman | Verdana | Georgia原创 2016-07-27 17:25:56 · 744 阅读 · 1 评论 -
HDU 1175 连连看【BFS】
连连看Time Limit : 20000/10000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 21 Accepted Submission(s) : 5Font: Times New Roman | Verdana | GeorgiaFont原创 2016-07-27 16:34:35 · 677 阅读 · 0 评论 -
HDU 1078 FatMouse and Cheese【第一道记忆化搜索题】
第一次做记忆化搜索的问题 查找了网上的资料参考了网上对记忆化搜索的解释 1.记忆化搜索的思想 记忆化搜索的思想是,在搜索过程中,会有很多重复计算,如果我们能记录一些状态的答案,就可以减少重复搜索量2、记忆化搜索的适用范围 根据记忆化搜索的思想,它是解决重复计算,而不是重复生成,也就是说,这些搜索必须是在搜索扩展路径的过程中分步计算的题目,也就是“搜索答案原创 2016-07-12 22:23:26 · 1542 阅读 · 0 评论 -
HDU 1157 Who's in the Middle【水题】
Who's in the MiddleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14625 Accepted Submission(s): 6564Problem DescriptionFJ is原创 2016-05-08 00:21:48 · 577 阅读 · 0 评论 -
HDU 1098 Ignatius's puzzle
Ignatius's puzzleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8526 Accepted Submission(s): 5907Problem DescriptionIgnatius原创 2016-05-14 14:57:25 · 526 阅读 · 0 评论 -
HDU 1029 Ignatius and the Princess IV
Ignatius and the Princess IVTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32767 K (Java/Others)Total Submission(s): 25883 Accepted Submission(s): 10938Problem Descriptio原创 2016-05-14 12:21:19 · 1790 阅读 · 3 评论 -
HDU 1017 A Mathematical Curiosity【水题】
A Mathematical CuriosityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36048 Accepted Submission(s): 11498Problem DescriptionGiv原创 2016-05-14 10:40:00 · 582 阅读 · 0 评论 -
HDU 1014 Uniform Generator【公约数】
Uniform GeneratorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24901 Accepted Submission(s): 9836Problem DescriptionComputer si原创 2016-05-13 20:39:02 · 823 阅读 · 0 评论 -
HDU 1013 Digital Roots【水题】
Digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 67953 Accepted Submission(s): 21239Problem DescriptionThe digital ro原创 2016-05-13 18:09:50 · 434 阅读 · 0 评论 -
HDU 1081 To The Max【DP】【最大子段矩阵求和】
D - To The MaxCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice HDU 1081 Appoint descripti原创 2016-02-25 21:28:05 · 771 阅读 · 0 评论 -
HDU 1005 Number Sequence【循环节】
Number SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 148284 Accepted Submission(s): 36044Problem DescriptionA number se原创 2016-05-11 21:58:08 · 634 阅读 · 2 评论 -
HDU 1012 u Calculate e
u Calculate eTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40656 Accepted Submission(s): 18488Problem DescriptionA simple mathe原创 2016-05-10 23:29:07 · 375 阅读 · 0 评论 -
HDU 1180 诡异的楼梯【BFS广搜+优先队列】
诡异的楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 12958 Accepted Submission(s): 3260Problem DescriptionHogwarts正式开学以后,Har原创 2016-07-21 21:24:32 · 605 阅读 · 0 评论