﻿<?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++博客-冰王子Leo与ACM一起的成长</title><link>http://www.cppblog.com/LeoW/</link><description>当你改变了每一个人未来的生活方式时，你就改变了世界！</description><language>zh-cn</language><lastBuildDate>Mon, 13 Apr 2026 09:39:29 GMT</lastBuildDate><pubDate>Mon, 13 Apr 2026 09:39:29 GMT</pubDate><ttl>60</ttl><item><title>hdu 1384(Intervals)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/26/185247.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Thu, 26 Jul 2012 13:46:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/26/185247.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/185247.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/26/185247.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/185247.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/185247.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 差分约束方程，建图难，核心还是寻找约束条件，本题的三个约束条件还是比较易见的&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/26/185247.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/185247.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-26 21:46 <a href="http://www.cppblog.com/LeoW/archive/2012/07/26/185247.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1423(Greatest Common Increasing Subsequence)最长不降公共子序列</title><link>http://www.cppblog.com/LeoW/archive/2012/07/19/184219.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Thu, 19 Jul 2012 12:02:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/19/184219.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/184219.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/19/184219.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/184219.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/184219.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 经典！&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/19/184219.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/184219.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-19 20:02 <a href="http://www.cppblog.com/LeoW/archive/2012/07/19/184219.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1124(Factorial)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/18/184025.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Wed, 18 Jul 2012 02:10:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/18/184025.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/184025.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/18/184025.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/184025.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/184025.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 简单数学题 数的知识&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/18/184025.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/184025.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-18 10:10 <a href="http://www.cppblog.com/LeoW/archive/2012/07/18/184025.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1113(Word Amalgamation)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/16/183683.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Mon, 16 Jul 2012 01:35:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/16/183683.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/183683.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/16/183683.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/183683.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/183683.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 字典树的实际运用~&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/16/183683.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/183683.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-16 09:35 <a href="http://www.cppblog.com/LeoW/archive/2012/07/16/183683.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1400(Mondriaan's Dream)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/14/183375.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Sat, 14 Jul 2012 06:55:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/14/183375.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/183375.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/14/183375.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/183375.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/183375.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 非常经典的状态DP&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/14/183375.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/183375.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-14 14:55 <a href="http://www.cppblog.com/LeoW/archive/2012/07/14/183375.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1204(糖果大战)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/13/183127.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Fri, 13 Jul 2012 02:14:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/13/183127.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/183127.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/13/183127.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/183127.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/183127.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 神奇的数学题 概率分析 亮点是递推过程采用了辅助函数 /f[i]<br>f[0]=0 f[n+m]=1&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/13/183127.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/183127.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-13 10:14 <a href="http://www.cppblog.com/LeoW/archive/2012/07/13/183127.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1561(The more, The Better)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/12/183062.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Thu, 12 Jul 2012 14:15:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/12/183062.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/183062.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/12/183062.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/183062.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/183062.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 简单的树形DP（01背包问题）但大一统的思想很关键~&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/12/183062.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/183062.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-12 22:15 <a href="http://www.cppblog.com/LeoW/archive/2012/07/12/183062.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1513(Palindrome)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/11/182873.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Wed, 11 Jul 2012 11:56:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/11/182873.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/182873.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/11/182873.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/182873.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/182873.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 滚动数组+DP~~&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/11/182873.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/182873.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-11 19:56 <a href="http://www.cppblog.com/LeoW/archive/2012/07/11/182873.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1502(Regular Words)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/11/182845.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Wed, 11 Jul 2012 08:09:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/11/182845.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/182845.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/11/182845.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/182845.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/182845.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: DP+高精度加法 不错！&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/11/182845.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/182845.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-11 16:09 <a href="http://www.cppblog.com/LeoW/archive/2012/07/11/182845.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1227(Fast Food)</title><link>http://www.cppblog.com/LeoW/archive/2012/07/11/182789.html</link><dc:creator>Leo.W</dc:creator><author>Leo.W</author><pubDate>Wed, 11 Jul 2012 03:10:00 GMT</pubDate><guid>http://www.cppblog.com/LeoW/archive/2012/07/11/182789.html</guid><wfw:comment>http://www.cppblog.com/LeoW/comments/182789.html</wfw:comment><comments>http://www.cppblog.com/LeoW/archive/2012/07/11/182789.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/LeoW/comments/commentRss/182789.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/LeoW/services/trackbacks/182789.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 邮局问题，经典！！ 餐馆是因变量，邮局是自变量，dp依据每增加一个邮局的变化。&nbsp;&nbsp;<a href='http://www.cppblog.com/LeoW/archive/2012/07/11/182789.html'>阅读全文</a><img src ="http://www.cppblog.com/LeoW/aggbug/182789.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/LeoW/" target="_blank">Leo.W</a> 2012-07-11 11:10 <a href="http://www.cppblog.com/LeoW/archive/2012/07/11/182789.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>