
bfs
无
鸡冠花12138
这个作者很懒,什么都没留下…
展开
-
bfs
迷宫的最短路径之BFS算法给定一个大小为N*M的迷宫,由通道('.')和墙壁('#')组成,其中通道S表示起点,通道G表示终点,每一步移动可以达到上下左右中不是墙壁的位置。试求出起点到终点的最小步数。(本题假定迷宫是有解的)(N,M样例输入:10 10样例输出:22这道题目以及解法均来自《挑战程序设计竞赛(第2版)》第34页-原创 2017-08-25 15:10:15 · 236 阅读 · 0 评论 -
hdu2612(bfs)
Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24977 Accepted Submission(s): 8146Problem DescriptionPass a year learning in...原创 2018-10-23 18:22:22 · 185 阅读 · 0 评论 -
hdu2102(bfs)
A计划Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 30466 Accepted Submission(s): 7635Problem Description可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后,而今,...原创 2018-10-23 20:44:16 · 158 阅读 · 0 评论 -
2016 ICPC北京 problem E.What a Ridiculous Election(预处理bfs)
What a Ridiculous ElectionIn country Light Tower, a presidential election is going on. There are two candidates, Mr. X1 and Mr. X2, and both of them are not like good persons. One is called a liar a...原创 2018-10-31 18:08:52 · 270 阅读 · 0 评论