搜索
MAKE_TROUBLE
I STILL
展开
-
Red and Black 搜索
转载自http://blog.csdn.net/zone_programming/article/details/6688424 DFS 转载自http://blog.163.com/cristiano_faith/blog/static/1725054812011116103645188/ BFS Red and Black Time Limit : 2000/1000ms (转载 2013-07-17 09:44:25 · 862 阅读 · 0 评论 -
Tempter of the Bone
Tempter of the Bone Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 33445 Accepted Submission(s): 9015 Problem Description The dog原创 2013-07-24 16:09:33 · 634 阅读 · 0 评论 -
hdu 搜索专题
1:A strange lift Kill the monster Red and Black Counting Sheep Knight Moves Oil Deposits 2:Square Sum It Up Catch That Cow Robot Motion原创 2013-07-20 09:33:50 · 896 阅读 · 0 评论 -
Square hdu 1518
Square Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5695 Accepted Submission(s): 1804 Problem Description Given a set of sticks原创 2013-07-19 20:31:36 · 651 阅读 · 0 评论 -
Nightmare hdu 1072
Nightmare Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5420 Accepted Submission(s): 2691 Problem Description Ignatius had a night原创 2013-07-20 11:41:21 · 543 阅读 · 0 评论 -
Robot Motion HDU 1035
Robot Motion Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5009 Accepted Submission(s): 2319 Problem Description A robot has b原创 2013-07-19 16:00:21 · 652 阅读 · 0 评论 -
Prime Ring Problem hdu 1016
Prime Ring Problem Time Limit : 4000/2000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 17 Accepted Submission(s) : 13 Font: Times New Roman | Verdana | Georgia原创 2013-07-19 08:57:14 · 703 阅读 · 0 评论 -
Accepted Necklace 2660
Accepted Necklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2218 Accepted Submission(s): 863 Problem Description I have N prec转载 2013-07-19 08:55:05 · 701 阅读 · 0 评论 -
深搜和广搜的区别和中心思想
转载自http://blog.csdn.net/bool_isprime/article/details/5803018 深度优先搜索和广度优先搜索的深入讨论 (一)深度优先搜索的特点是: (1)从上面几个实例看出,可以用深度优先搜索的方法处理的题目是各种各样的。有的搜索深度是已知和固定的,如例题2-4,2-5,2-6;有的是未知的,如例题2-7、例题2-8;有的搜索转载 2013-07-17 08:39:15 · 1082 阅读 · 0 评论 -
Can you find it? hdu 2141
Can you find it? Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others) Total Submission(s): 7954 Accepted Submission(s): 2073 Problem Description Give you thr原创 2013-07-25 08:37:24 · 604 阅读 · 0 评论