zxiaopp的专栏

不错的一道广度搜索题，有进一步熟悉了广搜的步骤。。 Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7953    Accepted Submission(s): 3816 Prob

Hiking Trip Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1374    Accepted Submission(s): 607 Problem Description Hiking in the m

Asteroids! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3966    Accepted Submission(s): 2566 Problem Description You're in space

最近BFS类型的题目也做了不少了，总结一下大体思路: 具体问题具体改变，一般都是这个解法 #include #include #include #include using namespace std; const int maxn=100; bool vst[maxn][maxn]; // 访问标记 int map[maxn][maxn] //存储每个点的状态 int sx,sy,g

 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