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 mmd at 2006-11-30 21:29:10 on Problem 1459
In Reply To:用标号法求最大流 怎么改进一下呢?TLE了n次?各位大牛都是怎么求的最大流? Posted by:happyending at 2006-11-30 21:22:12


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