 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
我的第一道bfs题，还算简单，之前做了到一摸一样的，那时用的是DFSBFS直接一步步走，走到终点就返回，每一个点的步数是之前点的步数+1. DFS从头搜到底，记录每一个点的最小步数，要知道最大不可能超过6步，8X8的棋盘里最少6步就可以到任意点。每次只要走的部署超过6就停，并且不断更新这个最小步数，一旦走的部署超过当前的最小步数就停止，要不然会TLE. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
