Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:我是LZ。关于楼上我想解释。

Posted by yoyow110w at 2012-06-30 01:58:46 on Problem 2329
In Reply To:楼主没考虑if d[queue[top,1],queue[top,2]]+1<d[queue[top,1]+dx[i],queue[top,2]+dy[i]] 的情况 Posted by:swust20105592 at 2011-10-29 10:53:05
> 有可能前两次搜到某个零的距离相等但不是最短却被置0了,而且楼主代码不再更新该点,看来是数据太弱了。。

————————————————————————————————
两年后再看代码感触良多。
楼上这位同学说的我觉得不对。
我的算法是从非0的点开始一圈一圈扩展,也就是说我每次扩展出的点已经是最短距离的状态,不会再出现之后的搜索能够覆盖之前的点。
请不要质疑数据。

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator