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

网络流的复杂度本来就是极度悲观的界,一般情况到不了的

Posted by wywcgs at 2006-09-04 01:41:16 on Problem 1815
In Reply To:是O(V)枚举拿掉的点再每次求最大流么? 感觉这样复杂度好高... Posted by:LongHell at 2006-09-03 21:05:32


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