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

bfm可以很慢的...即使m=O(n)...

Posted by frkstyc at 2006-10-23 19:06:24 on Problem 3013
In Reply To:既然这道题过不去，那就证明那篇论文写得不对 Posted by:wywcgs at 2006-10-23 19:03:53 
> 我不知道spfa究竟能什么效率，我只知道最差时间界
> O(ElgV) or O(E+VlogV)  vs O(VE)
             ~~~~~~~~~~这个bt了……
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