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

改进了的是什么,有没有跟流量F无关,而跟点数N,边数M有关的算法?

Posted by bluewind at 2007-10-22 12:31:56
In Reply To:朴素实现是O(EF),E是边数F是最大流量 Posted by:wywcgs at 2007-10-22 10:50:31


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