![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
BFS
zxiaopp
这个作者很懒,什么都没留下…
展开
-
Nightmare
不错的一道广度搜索题,有进一步熟悉了广搜的步骤。。NightmareTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7953 Accepted Submission(s): 3816Prob原创 2015-04-10 08:33:07 · 321 阅读 · 0 评论 -
2425 Hiking Trip
Hiking TripTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1374 Accepted Submission(s): 607Problem DescriptionHiking in the m原创 2015-04-12 21:12:11 · 580 阅读 · 0 评论 -
1240 Asteroids!
Asteroids!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3966 Accepted Submission(s): 2566Problem DescriptionYou're in space原创 2015-04-13 15:29:51 · 521 阅读 · 1 评论 -
关于BFS的总结
最近BFS类型的题目也做了不少了,总结一下大体思路:具体问题具体改变,一般都是这个解法#include#include#include#includeusing namespace std;const int maxn=100;bool vst[maxn][maxn]; // 访问标记int map[maxn][maxn] //存储每个点的状态int sx,sy,g原创 2015-04-13 15:36:14 · 552 阅读 · 0 评论 -
1599 - Ideal Path
New labyrinth attraction is open in New Lostland amusement park. The labyrinth consists of n rooms connected by m passages. Each passage is colored into some color ci. Visitors of the labyrinth原创 2015-09-07 17:08:27 · 470 阅读 · 0 评论