#搜索算法 DFS/BFS#
文章平均质量分 78
Fighting_Dream
这个作者很懒,什么都没留下…
展开
-
HDoj-2717-Catch That Cow-BFS
Catch That CowTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8117 Accepted Submission(s): 2571Problem DescriptionFarmer John has原创 2015-03-24 09:24:47 · 845 阅读 · 0 评论 -
nyoj-20-吝啬的国度-DFS+容器
吝啬的国度时间限制:1000 ms | 内存限制:65535 KB难度:3描述在一个吝啬的国度里有N个城市,这N个城市间只有N-1条路把这个N个城市连接起来。现在,Tom在第S号城市,他有张该国地图,他想知道如果自己要去参观第T号城市,必须经过的前一个城市是几号城市(假设你不走重复的路)。输入第一行输入一个整数M表示测试数据共有M(1每组测试数据的第原创 2015-04-01 17:30:06 · 615 阅读 · 0 评论 -
HDU 1342 Lotto-DFS
LottoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1663 Accepted Submission(s): 815Problem DescriptionIn a Lotto I have ever pl原创 2015-04-01 17:27:22 · 613 阅读 · 0 评论 -
hdoj-2612-find a way-双向BFS
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4854 Accepted Submission(s): 1650Problem DescriptionPass a year learnin原创 2015-04-04 11:16:47 · 822 阅读 · 0 评论 -
NYoj-42-一笔画问题-DFS
一笔画问题时间限制:3000 ms | 内存限制:65535 KB难度:4描述zyc从小就比较喜欢玩一些小游戏,其中就包括画一笔画,他想请你帮他写一个程序,判断一个图是否能够用一笔画下来。规定,所有的边都只能画一次,不能重复画。 输入第一行只有一个正整数N(N每组测试数据的第一行有两个正整数P,Q(P随后的Q行,每行有原创 2014-12-09 20:08:20 · 1125 阅读 · 0 评论 -
NYOJ 284 坦克大战 【BFS】+【优先队列】
坦克大战时间限制:1000 ms | 内存限制:65535 KB难度:3描述Many of us had played the game "Battle city" in our childhood, and some people (like me) even often play it on computer now. What we are discu转载 2015-04-16 20:36:52 · 602 阅读 · 0 评论 -
poj 1011 Sticks - 经典DFS
点击打开题目链接//poj1011经典搜索#include#include#includeusing namespace std;int a[65];bool vis[65];int n;int dfs(int len,int need_len,int num)/*三个系数分别代表 当前的搜索长度, 达到目的要求还需要的长度, 还未拼接的木棒个数 */ {原创 2015-07-26 15:10:26 · 526 阅读 · 0 评论 -
HDoj-1312-Red and Black -BFS
Red and BlackTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10064 Accepted Submission(s): 6276Problem DescriptionThere is a rect原创 2014-11-15 14:38:45 · 754 阅读 · 0 评论 -
HDOj-2209-翻纸牌游戏-DFS
翻纸牌游戏Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2622 Accepted Submission(s): 943Problem Description有一种纸牌游戏,很有意思,给你N张纸牌,一字排开,原创 2015-04-01 17:40:13 · 821 阅读 · 0 评论 -
HDOJ 1015 Safecracker-DFS
SafecrackerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9548 Accepted Submission(s): 4860Problem Description=== Op tech briefi原创 2015-04-01 17:33:59 · 549 阅读 · 0 评论 -
HDoj-1010-Tempter of the Bone-DFS
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 74250 Accepted Submission(s): 20326Problem DescriptionThe dogg原创 2014-11-30 10:44:25 · 722 阅读 · 0 评论 -
HDoj-胜利大逃亡-BFS
胜利大逃亡Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26220 Accepted Submission(s): 9987Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去原创 2014-12-01 21:24:11 · 688 阅读 · 0 评论 -
搜索算法总结
搜索有以下几种算法:枚举算法:也即列举问题的所有状态从而寻找符合问题的解的方法。适合用于状态较少,比较简单的问题上。广度优先搜索:从初始点开始,根据规则展开第一层节点,并检查目标节点是否在这些节点上,若没有,再将所有的第一层的节点逐一展开,得到第二层节点,如没有,则扩展下去,直到发现目标节点为止。比较适合求最少步骤或最短解序列的题目。一般设置一个队列queue ,将起始转载 2014-12-17 10:44:16 · 995 阅读 · 0 评论 -
HDoj-1016-Prime Ring Problem-DFS
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27754 Accepted Submission(s): 12338Problem DescriptionA ring is原创 2014-10-31 19:01:01 · 701 阅读 · 0 评论 -
Uva572-poj-1562-hdoj--1241--oil Deposits-DFS
【科普】什么是BestCoder?如何参加?Oil DepositsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13119 Accepted Submission(s): 7600Pro原创 2014-12-02 14:47:47 · 878 阅读 · 0 评论 -
NYoj21-三个水杯-BFS
三个水杯时间限制:1000 ms | 内存限制:65535 KB难度:4描述给出三个水杯,大小不一,并且只有最大的水杯的水是装满的,其余两个为空杯子。三个水杯之间相互倒水,并且水杯没有标识,只能根据给出的水杯体积来计算。现在要求你写出一个程序,使其输出使初始状态到达目标状态的最少次数。输入第一行一个整数N(0接下来每组测试数据有两行,第一行给出三原创 2014-12-16 15:57:49 · 653 阅读 · 0 评论 -
uva-439 - HDOJ-1372-Knight Moves-翻译详解-BFS
Knight MovesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7012 Accepted Submission(s): 4238Problem DescriptionA friend of you i翻译 2014-12-16 22:50:44 · 837 阅读 · 0 评论 -
NYOJ-43 24 Point game-DFS
24 Point game时间限制:3000 ms | 内存限制:65535 KB难度:5描述There is a game which is called 24 Point game.In this game , you will be given some numbers. Your task is to find an expressi原创 2014-12-09 19:57:37 · 1025 阅读 · 0 评论 -
HDU 1242 Rescue BFS+优先队列
题目链接:点击打开链接http://acm.hdu.edu.cn/showproblem.php?pid=1242#include #include #include #include #include #include using namespace std;const int N=220;int n,m,stx,sty,endx,endy;char mp[N]原创 2015-07-23 20:01:20 · 658 阅读 · 0 评论