﻿<?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++博客-极限定律-随笔分类-ACM/ICPC</title><link>http://www.cppblog.com/mythit/category/10302.html</link><description>My Algorithm Space</description><language>zh-cn</language><lastBuildDate>Fri, 14 Aug 2009 16:45:07 GMT</lastBuildDate><pubDate>Fri, 14 Aug 2009 16:45:07 GMT</pubDate><ttl>60</ttl><item><title>POJ 1178 Camelot Floyd算法+枚举</title><link>http://www.cppblog.com/mythit/archive/2009/07/02/89123.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 02 Jul 2009 15:57:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/07/02/89123.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/89123.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/07/02/89123.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/89123.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/89123.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Floyd 枚举&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/07/02/89123.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/89123.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-07-02 23:57 <a href="http://www.cppblog.com/mythit/archive/2009/07/02/89123.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1141 Brackets Sequence 动态规划</title><link>http://www.cppblog.com/mythit/archive/2009/06/29/88753.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Mon, 29 Jun 2009 03:31:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/29/88753.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/88753.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/29/88753.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/88753.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/88753.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/29/88753.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/88753.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-29 11:31 <a href="http://www.cppblog.com/mythit/archive/2009/06/29/88753.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1088 滑雪 记忆化DP</title><link>http://www.cppblog.com/mythit/archive/2009/06/26/88540.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 25 Jun 2009 16:39:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/26/88540.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/88540.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/26/88540.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/88540.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/88540.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/26/88540.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/88540.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-26 00:39 <a href="http://www.cppblog.com/mythit/archive/2009/06/26/88540.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1661 Help Jimmy 动态规划</title><link>http://www.cppblog.com/mythit/archive/2009/06/26/88539.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 25 Jun 2009 16:37:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/26/88539.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/88539.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/26/88539.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/88539.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/88539.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/26/88539.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/88539.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-26 00:37 <a href="http://www.cppblog.com/mythit/archive/2009/06/26/88539.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1015 Jury Compromise 动态规划</title><link>http://www.cppblog.com/mythit/archive/2009/06/23/88378.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Tue, 23 Jun 2009 09:08:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/23/88378.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/88378.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/23/88378.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/88378.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/88378.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/23/88378.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/88378.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-23 17:08 <a href="http://www.cppblog.com/mythit/archive/2009/06/23/88378.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>NOIP 2006 能量项链 (石子合并类DP)</title><link>http://www.cppblog.com/mythit/archive/2009/06/22/88316.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Mon, 22 Jun 2009 12:20:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/22/88316.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/88316.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/22/88316.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/88316.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/88316.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/22/88316.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/88316.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-22 20:20 <a href="http://www.cppblog.com/mythit/archive/2009/06/22/88316.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ZOJ 1276 Optimal Array Multiplication Sequence 经典DP问题</title><link>http://www.cppblog.com/mythit/archive/2009/06/19/88066.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Fri, 19 Jun 2009 01:27:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/19/88066.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/88066.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/19/88066.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/88066.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/88066.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/19/88066.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/88066.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-19 09:27 <a href="http://www.cppblog.com/mythit/archive/2009/06/19/88066.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1157 LITTLE SHOP OF FLOWERS 动态规划</title><link>http://www.cppblog.com/mythit/archive/2009/06/16/87791.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Tue, 16 Jun 2009 05:57:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/16/87791.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/87791.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/16/87791.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/87791.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/87791.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/16/87791.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/87791.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-16 13:57 <a href="http://www.cppblog.com/mythit/archive/2009/06/16/87791.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1505 Copying Books 动态规划</title><link>http://www.cppblog.com/mythit/archive/2009/06/16/87770.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Tue, 16 Jun 2009 01:59:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/16/87770.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/87770.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/16/87770.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/87770.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/87770.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 动态规划&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/16/87770.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/87770.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-16 09:59 <a href="http://www.cppblog.com/mythit/archive/2009/06/16/87770.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 2115 模线性方程 ax=b(mod n)</title><link>http://www.cppblog.com/mythit/archive/2009/06/12/87514.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Fri, 12 Jun 2009 11:24:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/12/87514.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/87514.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/12/87514.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/87514.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/87514.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 模线性方程的解&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/12/87514.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/87514.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-12 19:24 <a href="http://www.cppblog.com/mythit/archive/2009/06/12/87514.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>矩阵求逆</title><link>http://www.cppblog.com/mythit/archive/2009/06/12/87448.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 11 Jun 2009 16:08:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/12/87448.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/87448.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/12/87448.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/87448.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/87448.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 逆矩阵算法&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/12/87448.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/87448.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-12 00:08 <a href="http://www.cppblog.com/mythit/archive/2009/06/12/87448.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>高斯消元法求解线性方程组(列主元消去法)</title><link>http://www.cppblog.com/mythit/archive/2009/06/11/87420.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 11 Jun 2009 11:10:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/11/87420.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/87420.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/11/87420.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/87420.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/87420.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 高斯消元法&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/11/87420.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/87420.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-11 19:10 <a href="http://www.cppblog.com/mythit/archive/2009/06/11/87420.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>编程求解行列式的值</title><link>http://www.cppblog.com/mythit/archive/2009/06/11/87398.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 11 Jun 2009 06:21:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/11/87398.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/87398.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/11/87398.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/87398.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/87398.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 计算行列式的值&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/11/87398.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/87398.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-11 14:21 <a href="http://www.cppblog.com/mythit/archive/2009/06/11/87398.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POI 2001 Peaceful Commission 2-SAT问题</title><link>http://www.cppblog.com/mythit/archive/2009/06/07/87007.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Sun, 07 Jun 2009 10:59:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/07/87007.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/87007.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/07/87007.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/87007.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/87007.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 2-SAT&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/07/87007.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/87007.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-07 18:59 <a href="http://www.cppblog.com/mythit/archive/2009/06/07/87007.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>差分约束系统详解</title><link>http://www.cppblog.com/mythit/archive/2009/06/04/86756.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 04 Jun 2009 07:25:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/04/86756.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/86756.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/04/86756.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/86756.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/86756.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 差分约束&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/04/86756.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/86756.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-04 15:25 <a href="http://www.cppblog.com/mythit/archive/2009/06/04/86756.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 2195 Going Home 二分图完美匹配</title><link>http://www.cppblog.com/mythit/archive/2009/06/03/86644.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Wed, 03 Jun 2009 04:45:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/03/86644.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/86644.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/03/86644.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/86644.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/86644.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二分图完美匹配&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/03/86644.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/86644.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-03 12:45 <a href="http://www.cppblog.com/mythit/archive/2009/06/03/86644.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3692 Kindergarten 二分图最大独立集</title><link>http://www.cppblog.com/mythit/archive/2009/06/02/86542.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Tue, 02 Jun 2009 07:14:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/02/86542.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/86542.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/02/86542.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/86542.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/86542.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二分图最大独立集&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/02/86542.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/86542.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-02 15:14 <a href="http://www.cppblog.com/mythit/archive/2009/06/02/86542.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1274 The Perfect Stall 二分图最大匹配</title><link>http://www.cppblog.com/mythit/archive/2009/06/01/86416.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Mon, 01 Jun 2009 07:33:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/06/01/86416.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/86416.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/06/01/86416.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/86416.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/86416.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 二分图最大匹配&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/06/01/86416.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/86416.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-06-01 15:33 <a href="http://www.cppblog.com/mythit/archive/2009/06/01/86416.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3177 Redundant Paths 双连通分量+缩点</title><link>http://www.cppblog.com/mythit/archive/2009/05/30/86136.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Fri, 29 May 2009 17:18:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/30/86136.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/86136.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/30/86136.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/86136.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/86136.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 双连通分量 缩点 并查集&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/30/86136.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/86136.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-30 01:18 <a href="http://www.cppblog.com/mythit/archive/2009/05/30/86136.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3352 Road Construction 双连通分量+缩点</title><link>http://www.cppblog.com/mythit/archive/2009/05/29/86082.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Fri, 29 May 2009 10:53:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/29/86082.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/86082.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/29/86082.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/86082.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/86082.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 图论 双连通分量+缩点&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/29/86082.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/86082.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-29 18:53 <a href="http://www.cppblog.com/mythit/archive/2009/05/29/86082.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1523 SPF 割点+分割连通块的数量</title><link>http://www.cppblog.com/mythit/archive/2009/05/28/86026.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 28 May 2009 11:18:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/28/86026.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/86026.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/28/86026.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/86026.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/86026.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 图论 割点&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/28/86026.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/86026.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-28 19:18 <a href="http://www.cppblog.com/mythit/archive/2009/05/28/86026.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>ZOJ 1311 Network 求割点</title><link>http://www.cppblog.com/mythit/archive/2009/05/27/85945.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Wed, 27 May 2009 12:35:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/27/85945.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/85945.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/27/85945.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/85945.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/85945.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 图论 割点&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/27/85945.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/85945.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-27 20:35 <a href="http://www.cppblog.com/mythit/archive/2009/05/27/85945.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3164 Command Network 最小树形图</title><link>http://www.cppblog.com/mythit/archive/2009/05/26/85800.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Tue, 26 May 2009 08:03:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/26/85800.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/85800.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/26/85800.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/85800.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/85800.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最小树形图&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/26/85800.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/85800.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-26 16:03 <a href="http://www.cppblog.com/mythit/archive/2009/05/26/85800.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1236 Network of Schools 强连通分量+缩点</title><link>http://www.cppblog.com/mythit/archive/2009/05/25/85718.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Mon, 25 May 2009 08:21:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/25/85718.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/85718.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/25/85718.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/85718.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/85718.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 强连通分量 Korasaju算法 缩点&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/25/85718.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/85718.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-25 16:21 <a href="http://www.cppblog.com/mythit/archive/2009/05/25/85718.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>HDOJ 1016 Prime Ring Problem</title><link>http://www.cppblog.com/mythit/archive/2009/05/24/85591.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Sun, 24 May 2009 05:37:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/24/85591.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/85591.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/24/85591.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/85591.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/85591.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 素数环 dfs 回溯&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/24/85591.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/85591.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-24 13:37 <a href="http://www.cppblog.com/mythit/archive/2009/05/24/85591.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1459 Power Network 最大网络流</title><link>http://www.cppblog.com/mythit/archive/2009/05/23/85494.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Sat, 23 May 2009 01:54:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/23/85494.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/85494.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/23/85494.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/85494.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/85494.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: POJ 1459 最大网络流&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/23/85494.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/85494.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-23 09:54 <a href="http://www.cppblog.com/mythit/archive/2009/05/23/85494.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 1094 Sorting It All Out 拓扑排序</title><link>http://www.cppblog.com/mythit/archive/2009/05/19/83406.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Tue, 19 May 2009 12:43:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/19/83406.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/83406.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/19/83406.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/83406.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/83406.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: POJ 1094 拓扑排序&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/19/83406.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/83406.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-19 20:43 <a href="http://www.cppblog.com/mythit/archive/2009/05/19/83406.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>最远点对问题</title><link>http://www.cppblog.com/mythit/archive/2009/05/19/83374.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Tue, 19 May 2009 06:16:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/19/83374.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/83374.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/19/83374.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/83374.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/83374.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最远点对问题 凸包&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/19/83374.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/83374.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-19 14:16 <a href="http://www.cppblog.com/mythit/archive/2009/05/19/83374.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>最近点对问题</title><link>http://www.cppblog.com/mythit/archive/2009/05/18/83323.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Mon, 18 May 2009 15:28:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/18/83323.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/83323.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/18/83323.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/83323.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/83323.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 最近点对问题 分治算法&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/18/83323.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/83323.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-18 23:28 <a href="http://www.cppblog.com/mythit/archive/2009/05/18/83323.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>POJ 3264 RMQ问题</title><link>http://www.cppblog.com/mythit/archive/2009/05/14/82964.html</link><dc:creator>极限定律</dc:creator><author>极限定律</author><pubDate>Thu, 14 May 2009 08:05:00 GMT</pubDate><guid>http://www.cppblog.com/mythit/archive/2009/05/14/82964.html</guid><wfw:comment>http://www.cppblog.com/mythit/comments/82964.html</wfw:comment><comments>http://www.cppblog.com/mythit/archive/2009/05/14/82964.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/mythit/comments/commentRss/82964.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/mythit/services/trackbacks/82964.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: POJ 3264 RMQ问题&nbsp;&nbsp;<a href='http://www.cppblog.com/mythit/archive/2009/05/14/82964.html'>阅读全文</a><img src ="http://www.cppblog.com/mythit/aggbug/82964.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mythit/" target="_blank">极限定律</a> 2009-05-14 16:05 <a href="http://www.cppblog.com/mythit/archive/2009/05/14/82964.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>