 |
| ||||
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 | |||||||||
RE的可以看一下！！！用宽度优先搜索来解，在重考虑重复的情况下，每个节点可扩展出3个状态，呈指数级增长，所以要用数组来标记已访问过的状态，当状态的值小于0或者大于2*100000时就不必加入队列了，可以使用循环队列来重复利用空间 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
