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^2 m^0.5)...

Posted by frkstyc at 2006-03-27 23:43:49 on Problem 2771
In Reply To:网络流最好 v^3, 匈牙利 n*m Posted by:semonteer at 2006-03-27 22:17:08

Followed by:

恩，匈牙利最好 max{xxxx,xxxx} (0) semonteer 2006-03-28 10:02:32
- 叫做 hop... styc 同学搞过么？ (0) semonteer 2006-03-28 10:18:01
最大容量增广路就可以过。不过好慢，G++1500多ms, C++2000多ms, 不知道styc的那个600ms是不是用的预流推进？ (0) o_oXo_o 2006-04-11 09:48:07
- 匹配啊同学 (0) frkstyc 2006-04-11 09:49:09
  - 如果你用预流推进能有多快？ (0) o_oXo_o 2006-04-11 09:51:55
- 预流推进不至于那么短吧? (0) struct 2006-04-11 09:50:46
  - 也是阿。-_-b 不过我不会搞。所以不知道。 (0) o_oXo_o 2006-04-11 09:52:39

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