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(n^4)的可增广轨的方法吗?

Posted by c0500301036 at 2005-05-20 13:59:30 on Problem 2239
In Reply To:这题大家都是怎么做的,我的太慢了 Posted by:c0500301036 at 2005-05-17 15:59:08


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