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:找最长路不要用BellmanFord 用SPFA

Posted by CPP at 2007-10-08 09:00:15 on Problem 3422
In Reply To:找最长路不要用BellmanFord 用SPFA Posted by:zhougelin at 2007-10-07 23:19:24 
对啊，我就是使用SPFA啦,一样还是超时.SPFA找路的复杂度是多少？听说大概是O(km)??这道题还要注意那些地方？谢谢啦
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