﻿<?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++博客-极限定律</title><link>http://www.cppblog.com/mythit/</link><description>My Algorithm Space</description><language>zh-cn</language><lastBuildDate>Mon, 06 Apr 2026 19:55:05 GMT</lastBuildDate><pubDate>Mon, 06 Apr 2026 19:55:05 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>6</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>1</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>12</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></channel></rss>