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

dijkstra里面求出的最短距离是单调递增的，而这里求出的最大容量是单调递减的，两者可以类比

Posted by frkstyc at 2006-03-18 22:16:59 on Problem 1797
In Reply To:用dijkstra怎么做.这可不是求最短路径呀....哪位讲讲. Posted by:MIBG at 2006-03-18 21:59:56 
只要对dijkstra理解透彻上面那句话不难理解
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