﻿<?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;-文章分类-网络流</title><link>http://www.cppblog.com/imky/category/14582.html</link><description>&lt;p style="color:Blue"&gt;&lt;b&gt;&lt;big&gt;----imky&lt;/b&gt;&lt;/p&gt;                </description><language>zh-cn</language><lastBuildDate>Sat, 14 Aug 2010 20:53:57 GMT</lastBuildDate><pubDate>Sat, 14 Aug 2010 20:53:57 GMT</pubDate><ttl>60</ttl><item><title>最大点权独立集 POJ 1569/1565</title><link>http://www.cppblog.com/imky/articles/123460.html</link><dc:creator>imky</dc:creator><author>imky</author><pubDate>Sat, 14 Aug 2010 12:50:00 GMT</pubDate><guid>http://www.cppblog.com/imky/articles/123460.html</guid><wfw:comment>http://www.cppblog.com/imky/comments/123460.html</wfw:comment><comments>http://www.cppblog.com/imky/articles/123460.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/imky/comments/commentRss/123460.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/imky/services/trackbacks/123460.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: CodeCode highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->&nbsp;&nbsp;1//hdu&nbsp;1569&nbsp;最大点权独立集&nbsp;&nbsp;2//一直WA&nbsp;结果发现又是算法理解错了：来源于amber的最小割模型在信息学竞...&nbsp;&nbsp;<a href='http://www.cppblog.com/imky/articles/123460.html'>阅读全文</a><img src ="http://www.cppblog.com/imky/aggbug/123460.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-14 20:50 <a href="http://www.cppblog.com/imky/articles/123460.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 3046 Dinic之多重增广</title><link>http://www.cppblog.com/imky/articles/123430.html</link><dc:creator>imky</dc:creator><author>imky</author><pubDate>Sat, 14 Aug 2010 06:58:00 GMT</pubDate><guid>http://www.cppblog.com/imky/articles/123430.html</guid><wfw:comment>http://www.cppblog.com/imky/comments/123430.html</wfw:comment><comments>http://www.cppblog.com/imky/articles/123430.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/imky/comments/commentRss/123430.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/imky/services/trackbacks/123430.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 多重增广的核心在使用了一个记录回溯数组：在如下代码中为mark[]：CodeCode highlighting produced by Actipro CodeHighlighter (freeware)http://www.CodeHighlighter.com/-->&nbsp;&nbsp;1//hdu&nbsp;3046&nbsp;&nbsp;2&nbsp;&nbsp;3#include...&nbsp;&nbsp;<a href='http://www.cppblog.com/imky/articles/123430.html'>阅读全文</a><img src ="http://www.cppblog.com/imky/aggbug/123430.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-14 14:58 <a href="http://www.cppblog.com/imky/articles/123430.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>