﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-CisJiong-随笔分类-模板</title><link>http://www.cppblog.com/cisjiong/category/14128.html</link><description>Always online</description><language>zh-cn</language><lastBuildDate>Sat, 26 Jun 2010 18:27:40 GMT</lastBuildDate><pubDate>Sat, 26 Jun 2010 18:27:40 GMT</pubDate><ttl>60</ttl><item><title>KM模板</title><link>http://www.cppblog.com/cisjiong/archive/2010/06/26/118771.html</link><dc:creator>CisJiong</dc:creator><author>CisJiong</author><pubDate>Sat, 26 Jun 2010 05:39:00 GMT</pubDate><guid>http://www.cppblog.com/cisjiong/archive/2010/06/26/118771.html</guid><wfw:comment>http://www.cppblog.com/cisjiong/comments/118771.html</wfw:comment><comments>http://www.cppblog.com/cisjiong/archive/2010/06/26/118771.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/cisjiong/comments/commentRss/118771.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/cisjiong/services/trackbacks/118771.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: KM，解决最大权匹配问题。最小权匹配的办法是用一个很大的数-当前边权值，而不是直接对边权取反(这样只能处理左右点相等的完全二分图，即K(n, n)).HDU2426 Interesting Housing Problemhttp://acm.hdu.edu.cn/showproblem.php?pid=2426给出n个人对m个房间的喜欢度，求总喜欢度最大的匹配。赤裸裸KM求最大权，本题无视负权。...&nbsp;&nbsp;<a href='http://www.cppblog.com/cisjiong/archive/2010/06/26/118771.html'>阅读全文</a><img src ="http://www.cppblog.com/cisjiong/aggbug/118771.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/cisjiong/" target="_blank">CisJiong</a> 2010-06-26 13:39 <a href="http://www.cppblog.com/cisjiong/archive/2010/06/26/118771.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>