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

复杂度当然还是O(nm),但比朴素Bellman快

Posted by zhougelin at 2007-10-08 10:05:12 on Problem 3422
In Reply To:Re:找最长路不要用BellmanFord 用SPFA Posted by:frkstyc at 2007-10-08 09:43:52
> 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