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:也对,像这题的图多半是稀疏的图了。。。直接BFS找最短路,找邻接点时现算就可。。O(L+n)。所以先用O(n2)预处理反而不合算

Posted by hanjialong at 2008-08-27 18:17:12 on Problem 3439
In Reply To:也对,像这题的图多半是稀疏的图了。。。直接BFS找最短路,找邻接点时现算就可。。O(L+n)。所以先用O(n2)预处理反而不合算 Posted by:hanjialong at 2008-08-27 18:16:05
错了,是O(L*n),L是最短路径长

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