 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
这个题的边数比较多，用邻接矩阵存会增加操作复杂度，不过你用标号的话应该是最短路径最大流吧。这样不如最大路径最大流快In Reply To:用标号法求最大流 怎么改进一下呢？TLE了ｎ次？各位大牛都是怎么求的最大流？ Posted by:happyending at 2006-11-30 21:22:12 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
