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*n 的？

Posted by semonteer at 2005-09-19 13:01:52 on Problem 2047
In Reply To:这不就是一最大费用流吗? Posted by:number at 2005-09-19 12:37:45 
> 求两次最大费用可增广路,复杂度是2k(n+k),k表示一年的天数
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