 |
| ||||
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 | |||||||||
请教一个最小费用流的问题最小费用流的迭代算法，设f从零流到最大流共被改进了k次，第i次选择的可改进路（增广路）的费用为pi，那么会不会有p1≤p2≤p3≤……≤pk呢？ 怎么证明？在哪本书上有？谢谢！ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
