 |
| ||||
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 常见且有效的优化有两个 一个是高度标号初始化，bfs 一个是Gap Heuristic，无论是对距离标号增广路还是preflow-push都很有效 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
