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

大家不会嫌我唠叨吧？网络流的问题就一并问了：求最大流是只能用O(n^4)的可增广轨的方法吗？

Posted by c0500301036 at 2005-05-20 13:59:30 on Problem 2239
In Reply To:这题大家都是怎么做的，我的太慢了 Posted by:c0500301036 at 2005-05-17 15:59:08

Followed by:

highest label preflow push是O(V^2*E^(1/2)) (0) frkstyc 2005-05-20 14:00:30
现在最强的最大流好象是eloge的，完全看不懂。。。 (0) js05 2005-05-20 14:24:15
- 也有可能是v^2loge的，记得不怎么清楚了。。。 (0) js05 2005-05-20 14:24:50
- 临场写得出来才有用的，HLPP就很不容易写了，还要搞ElogE的，估计赛场上大家都写的FF或者EK了吧？ (0) frkstyc 2005-05-20 14:26:10

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