﻿<?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++博客-&lt;p style="align:center; color:Green"&gt;Flying in the sky.&lt;/p&gt;-文章分类-Acm hdu</title><link>http://www.cppblog.com/imky/category/14495.html</link><description>&lt;p style="color:Blue"&gt;&lt;b&gt;&lt;big&gt;宁为愚夫。&lt;/b&gt;&lt;/p&gt;                </description><language>zh-cn</language><lastBuildDate>Tue, 10 Aug 2010 21:20:26 GMT</lastBuildDate><pubDate>Tue, 10 Aug 2010 21:20:26 GMT</pubDate><ttl>60</ttl><item><title>Hdu 1533 / POJ 2195 最小费用最大流/(or) KM匹配</title><link>http://www.cppblog.com/imky/articles/122822.html</link><dc:creator>imky</dc:creator><author>imky</author><pubDate>Mon, 09 Aug 2010 10:44:00 GMT</pubDate><guid>http://www.cppblog.com/imky/articles/122822.html</guid><wfw:comment>http://www.cppblog.com/imky/comments/122822.html</wfw:comment><comments>http://www.cppblog.com/imky/articles/122822.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/imky/comments/commentRss/122822.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/imky/services/trackbacks/122822.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 此题为基本的KM匹配题目，在Hdu做的时候是在网络流专题里面，所以用最小费用最大流做了一下。这也是我第一次写最小费用最大流算法。&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 其中第一次为了采用标号法，使用dijkstra最短路来拓展增广路径，其中为了...&nbsp;&nbsp;<a href='http://www.cppblog.com/imky/articles/122822.html'>阅读全文</a><img src ="http://www.cppblog.com/imky/aggbug/122822.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/imky/" target="_blank">imky</a> 2010-08-09 18:44 <a href="http://www.cppblog.com/imky/articles/122822.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>