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

大家过这个题用的什么最小2分流匹配的算法?时间复杂度是多少?

Posted by kala at 2005-07-31 22:47:29 on Problem 2516

Followed by:

最小2分流匹配是什么东西.....召唤牛人...... (0) palmtenor 2005-07-31 22:56:12
- 用费用流做二分图的最小匹配…… (0) frkstyc 2005-07-31 22:57:45
  - 不对吧,2分明显是流的定语.... (0) palmtenor 2005-07-31 23:00:10
    - 看见没有！！！！我说得没错 (0) frkstyc 2005-07-31 23:14:08
我用最朴素的最小费用流过的.好像是KCMN(M+N)的,C是最大流量 (0) c0500448242 2005-07-31 22:56:36
不好意思,应该是2分图最优匹配...打错了 (0) kala 2005-07-31 23:13:26

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