<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sdfzrlt的博客]]></title><description><![CDATA[Fightだよ!]]></description><link>https://blog.youkuaiyun.com/Rlt1296</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Rlt1296]]></copyright><item><title><![CDATA[BZOJ 3438 小M的作物]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70340202</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70340202</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 22:55:52 +0800</pubDate><description><![CDATA[最大权闭合子图]]></description><category></category></item><item><title><![CDATA[BZOJ 1877 [SDOI2009]晨跑]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70339561</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70339561</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 21:18:40 +0800</pubDate><description><![CDATA[最小费用最大流]]></description><category></category></item><item><title><![CDATA[BZOJ 736 [CTSC1999][网络流24题] 星际转移]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70338709</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70338709</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 20:35:17 +0800</pubDate><description><![CDATA[分层图]]></description><category></category></item><item><title><![CDATA[COGS 439 [网络流24题] 软件补丁]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70313747</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70313747</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 13:17:51 +0800</pubDate><description><![CDATA[最短路]]></description><category></category></item><item><title><![CDATA[POJ 1422 Air Raid]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70308486</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70308486</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 09:58:30 +0800</pubDate><description><![CDATA[最小路径覆盖]]></description><category></category></item><item><title><![CDATA[POJ 1274 The Perfect Stall]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70307936</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70307936</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 08:55:04 +0800</pubDate><description><![CDATA[二分图最大匹配]]></description><category></category></item><item><title><![CDATA[POJ 1325 Machine Schedule]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70307895</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70307895</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 08:44:36 +0800</pubDate><description><![CDATA[二分图最大匹配]]></description><category></category></item><item><title><![CDATA[洛谷 P2825 [HEOI2016]游戏]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70307794</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70307794</guid><author>Rlt1296</author><pubDate>Fri, 21 Apr 2017 08:12:45 +0800</pubDate><description><![CDATA[二分图最大匹配]]></description><category></category></item><item><title><![CDATA[BZOJ 1497 [NOI2006]最大获利]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70306750</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70306750</guid><author>Rlt1296</author><pubDate>Thu, 20 Apr 2017 23:47:25 +0800</pubDate><description><![CDATA[最大权闭合子图]]></description><category></category></item><item><title><![CDATA[BZOJ 4821 [Sdoi2017]相关分析]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70306452</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70306452</guid><author>Rlt1296</author><pubDate>Thu, 20 Apr 2017 23:03:57 +0800</pubDate><description><![CDATA[线段树]]></description><category></category></item><item><title><![CDATA[洛谷 P2770 航空路线问题]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70265887</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70265887</guid><author>Rlt1296</author><pubDate>Thu, 20 Apr 2017 16:17:55 +0800</pubDate><description><![CDATA[最大费用最大流]]></description><category></category></item><item><title><![CDATA[COGS 461. [网络流24题] 餐巾]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70254464</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70254464</guid><author>Rlt1296</author><pubDate>Thu, 20 Apr 2017 10:12:32 +0800</pubDate><description><![CDATA[网络流费用流]]></description><category></category></item><item><title><![CDATA[COGS 734. [网络流24题] 方格取数问题]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70250425</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70250425</guid><author>Rlt1296</author><pubDate>Thu, 20 Apr 2017 00:19:32 +0800</pubDate><description><![CDATA[最大流]]></description><category></category></item><item><title><![CDATA[HDU 3987 Harry Potter and the Forbidden Forest]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70246219</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70246219</guid><author>Rlt1296</author><pubDate>Wed, 19 Apr 2017 22:35:11 +0800</pubDate><description><![CDATA[最小割]]></description><category></category></item><item><title><![CDATA[COGS 732. [网络流24题] 试题库]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70245156</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70245156</guid><author>Rlt1296</author><pubDate>Wed, 19 Apr 2017 20:52:57 +0800</pubDate><description><![CDATA[最大流]]></description><category></category></item><item><title><![CDATA[COGS 731. [网络流24题] 最长递增子序列]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70244908</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70244908</guid><author>Rlt1296</author><pubDate>Wed, 19 Apr 2017 20:34:06 +0800</pubDate><description><![CDATA[LIS+最大流]]></description><category></category></item><item><title><![CDATA[COGS 729. [网络流24题] 圆桌聚餐]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70244131</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70244131</guid><author>Rlt1296</author><pubDate>Wed, 19 Apr 2017 19:18:26 +0800</pubDate><description><![CDATA[最大流]]></description><category></category></item><item><title><![CDATA[洛谷 P3708 koishi的数学题]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70243581</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70243581</guid><author>Rlt1296</author><pubDate>Wed, 19 Apr 2017 18:10:13 +0800</pubDate><description><![CDATA[数学]]></description><category></category></item><item><title><![CDATA[BZOJ 1036 [ZJOI2008]树的统计Count]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70236936</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70236936</guid><author>Rlt1296</author><pubDate>Wed, 19 Apr 2017 09:41:31 +0800</pubDate><description><![CDATA[树链剖分]]></description><category></category></item><item><title><![CDATA[P2765 魔术球问题]]></title><link>https://blog.youkuaiyun.com/Rlt1296/article/details/70236469</link><guid>https://blog.youkuaiyun.com/Rlt1296/article/details/70236469</guid><author>Rlt1296</author><pubDate>Wed, 19 Apr 2017 08:50:15 +0800</pubDate><description><![CDATA[最小路径覆盖]]></description><category></category></item></channel></rss>