 |
| ||||
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:这个题的边数比较多，用邻接矩阵存会增加操作复杂度，不过你用标号的话应该是最短路径最大流吧。这样不如最大路径最大流快 Posted by:mmd at 2006-11-30 21:29:10 Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
