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

朴素的mincost是 O(V^3 E^2) ，那么这题要用什么样的复杂度才能过。。。

Posted by bluewind at 2007-10-23 09:55:46 on Problem 3422
In Reply To:超时超到不行了，真的用网络流？ Posted by:Cpp at 2007-10-07 23:15:14 
》50*50，就2500个顶点，每个顶点两三条边，都好几千条边，费用最大2000,最小费用流要O(nmc)，一直超时，到底要怎么搞？
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