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,从路径上每一点搜,暴搜就搜过了In Reply To:给个思路,如何判断那些墙多余?高人现身! Posted by:piratelzs at 2007-03-17 10:09:01 > 我现在的思路是用dfs寻路,并尽量不走原路,<得出是否为唯一最短路径> > 但是如何确定那些墙多余没有更好的办法,请哪位指点一二. Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator