Detail of message

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

用标号法求最大流　怎么改进一下呢？TLE了ｎ次？各位大牛都是怎么求的最大流？

Posted by happyending at 2006-11-30 21:22:12 on Problem 1459

Followed by:

这个题的边数比较多，用邻接矩阵存会增加操作复杂度，不过你用标号的话应该是最短路径最大流吧。这样不如最大路径最大流快 (0) mmd 2006-11-30 21:29:10
- 这道题我所有版本的网络流邻接表都比邻接矩阵慢 (0) wywcgs 2006-11-30 21:58:30
  - 我说错了，用邻接表会增加操作复杂度。。。 (0) mmd 2006-12-01 12:45:09
用前流推进吧，不优化读入200多ms就能ac (0) mmd 2006-11-30 21:29:54
距离标号最短增广路径？ (75) wywcgs 2006-11-30 22:00:46

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator