<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[P_rogrammer的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/P_rogrammer</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; P_rogrammer]]></copyright><item><title><![CDATA[HDU1532 - Drainage Ditches  网络流之最大流]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48135351</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48135351</guid><author>P_rogrammer</author><pubDate>Mon, 31 Aug 2015 15:58:01 +0800</pubDate><description><![CDATA[HDU1532 - Drainage Ditches  网络流: 最大流]]></description><category></category></item><item><title><![CDATA[HDU1233 - 还是畅通工程 最小生成树,用了三种姿势AC]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48030659</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48030659</guid><author>P_rogrammer</author><pubDate>Thu, 27 Aug 2015 17:15:56 +0800</pubDate><description><![CDATA[HDU1233 - 还是畅通工程 最小生成树,用了三种姿势AC]]></description><category></category></item><item><title><![CDATA[HDU1102 - Constructing Roads 用优先队列优化Prim最小生成树]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48027769</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48027769</guid><author>P_rogrammer</author><pubDate>Thu, 27 Aug 2015 14:55:13 +0800</pubDate><description><![CDATA[HDU1102 - Constructing Roads 用优先队列优化Prim最小生成树]]></description><category></category></item><item><title><![CDATA[HDU5154 - Harry and Magical Computer 拓补排序]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48026935</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48026935</guid><author>P_rogrammer</author><pubDate>Thu, 27 Aug 2015 14:11:26 +0800</pubDate><description><![CDATA[HDU5154 - Harry and Magical Computer 拓补排序]]></description><category></category></item><item><title><![CDATA[HDU4324 - Triangle LOVE 拓补排序]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48022753</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48022753</guid><author>P_rogrammer</author><pubDate>Thu, 27 Aug 2015 09:42:40 +0800</pubDate><description><![CDATA[HDU4324 - Triangle LOVE 拓补排序]]></description><category></category></item><item><title><![CDATA[HDU3342 - Legal or Not 拓补排序模板]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48010335</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48010335</guid><author>P_rogrammer</author><pubDate>Wed, 26 Aug 2015 21:21:10 +0800</pubDate><description><![CDATA[HDU3342 - Legal or Not 拓补排序模板]]></description><category></category></item><item><title><![CDATA[HDU2094 - 产生冠军 冠军: 总人数 - 失败过的人数 = 1]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48010185</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48010185</guid><author>P_rogrammer</author><pubDate>Wed, 26 Aug 2015 21:08:32 +0800</pubDate><description><![CDATA[HDU2094 - 产生冠军   冠军: 总人数 - 失败过的人数 = 1]]></description><category></category></item><item><title><![CDATA[HDU1285 - 确定比赛名次 拓补排序]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48010025</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48010025</guid><author>P_rogrammer</author><pubDate>Wed, 26 Aug 2015 20:56:06 +0800</pubDate><description><![CDATA[HDU1285 - 确定比赛名次 拓补排序算法]]></description><category></category></item><item><title><![CDATA[HDU1558 - Segment set 并查集 + 判断线段相交]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48009819</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48009819</guid><author>P_rogrammer</author><pubDate>Wed, 26 Aug 2015 20:41:10 +0800</pubDate><description><![CDATA[HDU1558 - Segment set 并查集 + 判断线段相交]]></description><category></category></item><item><title><![CDATA[HDU2473 - Junk-Mail Filter 利用虚拟数组实现删除并查集的节点]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48009427</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48009427</guid><author>P_rogrammer</author><pubDate>Wed, 26 Aug 2015 20:17:01 +0800</pubDate><description><![CDATA[HDU2473 - Junk-Mail Filter 增加一个虚拟数组,实现"删除"并查集某个节点的功能]]></description><category></category></item><item><title><![CDATA[HDU1856 - More is better 利用并查集找最大群体数目]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48009031</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48009031</guid><author>P_rogrammer</author><pubDate>Wed, 26 Aug 2015 19:52:47 +0800</pubDate><description><![CDATA[HDU1856 - More is better 利用并查, 集找最大群体数目]]></description><category></category></item><item><title><![CDATA[HDU1829 - A Bug's Life 分组并查集]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/48008545</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/48008545</guid><author>P_rogrammer</author><pubDate>Wed, 26 Aug 2015 19:18:29 +0800</pubDate><description><![CDATA[HDU1829 - A Bug's Life 分组并查集,和POJ上的"食物链"是同一类的题,这题是最基础的分组并查集.]]></description><category></category></item><item><title><![CDATA[HDU1863 - 畅通工程 Prim最小生成树算法]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47981653</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47981653</guid><author>P_rogrammer</author><pubDate>Tue, 25 Aug 2015 19:28:54 +0800</pubDate><description><![CDATA[HDU1863 - 畅通工程 Prim最小生成树算法，中午是用并查集的方法AC的，现在换个姿势，再来一次= =！]]></description><category></category></item><item><title><![CDATA[HDU1863 - 畅通工程 最小生成树的并查集方法实现]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47979073</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47979073</guid><author>P_rogrammer</author><pubDate>Tue, 25 Aug 2015 16:28:36 +0800</pubDate><description><![CDATA[HDU1863 - 畅通工程 最小生成树的并查集方法实现]]></description><category></category></item><item><title><![CDATA[HDU1272 - 小希的迷宫 并查集检测无向图的环]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47977127</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47977127</guid><author>P_rogrammer</author><pubDate>Tue, 25 Aug 2015 14:55:04 +0800</pubDate><description><![CDATA[HDU1272 - 小希的迷宫 利用并查集检测无向图的环]]></description><category></category></item><item><title><![CDATA[HDU1116-Play On Words  并查集,欧拉回路]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47974369</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47974369</guid><author>P_rogrammer</author><pubDate>Tue, 25 Aug 2015 11:20:07 +0800</pubDate><description><![CDATA[HDU1116 - Play On Words 并查集,欧拉回路]]></description><category></category></item><item><title><![CDATA[HDU2896-病毒侵袭 AC自动机]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47971479</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47971479</guid><author>P_rogrammer</author><pubDate>Tue, 25 Aug 2015 08:43:21 +0800</pubDate><description><![CDATA[HDU2896-病毒侵袭 AC自动机算法]]></description><category></category></item><item><title><![CDATA[HDU2222-Keywords Search AC自动机]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47953117</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47953117</guid><author>P_rogrammer</author><pubDate>Mon, 24 Aug 2015 16:30:14 +0800</pubDate><description><![CDATA[HDU2222-Keywords Search AC自动机算法]]></description><category></category></item><item><title><![CDATA[线段树维护区间的和和单点更新-HDU1166-敌兵布阵]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47860377</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47860377</guid><author>P_rogrammer</author><pubDate>Sat, 22 Aug 2015 16:10:50 +0800</pubDate><description><![CDATA[线段树单点更新和维护区间的和：HDU1166-敌兵布阵]]></description><category></category></item><item><title><![CDATA[并查集 HDU1325-Is It A Tree?]]></title><link>https://blog.youkuaiyun.com/P_rogrammer/article/details/47830729</link><guid>https://blog.youkuaiyun.com/P_rogrammer/article/details/47830729</guid><author>P_rogrammer</author><pubDate>Fri, 21 Aug 2015 10:30:27 +0800</pubDate><description><![CDATA[并查集 HDU1325-Is It A Tree?]]></description><category></category></item></channel></rss>