 |
| ||||
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 | |||||||||
楼主没考虑if d[queue[top,1],queue[top,2]]+1<d[queue[top,1]+dx[i],queue[top,2]+dy[i]] 的情况In Reply To:果断n^2的BFS可以AC啊 90行代码 63MS的 Posted by:yoyow110w at 2010-07-25 21:02:14 有可能前两次搜到某个零的距离相等但不是最短却被置0了，而且楼主代码不再更新该点，看来是数据太弱了。。 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
