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

ft,不会写匈牙利,写preflow用g++挤过去了

Posted by ArXoR at 2005-05-19 13:32:50 on Problem 2239
In Reply To:永远不要用网络流做匹配，这是hqm告诉我的，匈牙利是O(N^2)的吧 Posted by:TN at 2005-05-18 17:33:24

Followed by:

preflow又慢又麻烦，还是匈牙利好...... (2) TN 2005-05-19 13:37:21
- preflow好写嘛,比较短...只是我不懂匈牙利,正打算开始看-_-b...菜啊~~ (4) ArXoR 2005-05-19 13:46:04
  - 匈牙利比preflow好写不少吧？ (0) TN 2005-05-19 14:08:17
    - 我找不到Hungarian Method……CLRS上也没写，也是说的用maxflow去做 (0) frkstyc 2005-05-19 14:11:53
    - 用匈牙利怎么求最小覆盖啊？ (0) js05 2005-05-19 15:06:35
- 谁说preflow慢了？看我的1459 109ms，还是用了STL的 (4) frkstyc 2005-05-19 13:54:01
  - 我是指preflow做匹配...... (0) TN 2005-05-19 14:02:55
    - 邻接表的匈牙利是相当快的~~~ (0) palmtenor 2005-05-19 19:45:30

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