<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fobdddf的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/fobdddf</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fobdddf]]></copyright><item><title><![CDATA[非常好的理解遗传算法的例子]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/34808151</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/34808151</guid><author>fobdddf</author><pubDate>Thu, 26 Jun 2014 10:10:28 +0800</pubDate><description><![CDATA[转自：http://blog.youkuaiyun.com/b2b160/article/details/4680853]]></description><category></category></item><item><title><![CDATA[Codeforces 441C Valera and Tubes]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/29670785</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/29670785</guid><author>fobdddf</author><pubDate>Mon, 09 Jun 2014 23:51:40 +0800</pubDate><description><![CDATA[题目链接：Codeforces 441C Valera and Tubes
少看一个tia]]></description><category></category></item><item><title><![CDATA[Codeforces 385C Bear and Prime Numbers]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/29661983</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/29661983</guid><author>fobdddf</author><pubDate>Mon, 09 Jun 2014 23:26:06 +0800</pubDate><description><![CDATA[题目链接：Codeforces 385C Bear and Prime Numbers
看到"qunwe"]]></description><category></category></item><item><title><![CDATA[Codeforces 385B Bear and Strings]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/29659637</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/29659637</guid><author>fobdddf</author><pubDate>Mon, 09 Jun 2014 23:18:26 +0800</pubDate><description><![CDATA[题目链接：Codeforces 385B Bear and Strings]]></description><category></category></item><item><title><![CDATA[Codeforces 385A Bear and Raspberry]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/29658991</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/29658991</guid><author>fobdddf</author><pubDate>Mon, 09 Jun 2014 23:12:59 +0800</pubDate><description><![CDATA[题目链接：Codeforces 385A Bear and Raspberry]]></description><category></category></item><item><title><![CDATA[Codeforces 439C Devu and Partitioning of the Array]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28712953</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28712953</guid><author>fobdddf</author><pubDate>Thu, 05 Jun 2014 22:46:20 +0800</pubDate><description><![CDATA[题目连接：Codeforces 439C Devu and Partitioning of the Array
比较坑一题，很多细节。kan]]></description><category></category></item><item><title><![CDATA[Codeforces 439B Devu, the Dumb Guy]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28712525</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28712525</guid><author>fobdddf</author><pubDate>Thu, 05 Jun 2014 22:39:54 +0800</pubDate><description><![CDATA[题目链接：Codeforces 439B Devu, the Dumb Guy]]></description><category></category></item><item><title><![CDATA[Codeforces 439A Devu, the Singer and Churu, the Joker]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28712145</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28712145</guid><author>fobdddf</author><pubDate>Thu, 05 Jun 2014 22:37:20 +0800</pubDate><description><![CDATA[题目链接：Codeforces 439A Devu, the Singer and Churu, the Joker
#include 
#include 

using namespace std;

int main()
{
    int n, d, sum = 0, arr[120];
    scanf("%d%d", &n, &d);
    for(int i = 0; i < n]]></description><category></category></item><item><title><![CDATA[UVa 1411 Ants(KM)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28480089</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28480089</guid><author>fobdddf</author><pubDate>Wed, 04 Jun 2014 22:49:53 +0800</pubDate><description><![CDATA[题目链接：UVa 1411 Ants
汝佳大神的版~]]></description><category></category></item><item><title><![CDATA[POJ 2060 Taxi Cab Scheme(匈牙利—最小路径覆盖)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28473913</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28473913</guid><author>fobdddf</author><pubDate>Wed, 04 Jun 2014 22:47:02 +0800</pubDate><description><![CDATA[题目链接：POJ 2060 Taxi Cab Scheme]]></description><category></category></item><item><title><![CDATA[POJ 1325 Machine Schedule(匈牙利—最小点覆盖)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28472233</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28472233</guid><author>fobdddf</author><pubDate>Wed, 04 Jun 2014 22:26:03 +0800</pubDate><description><![CDATA[题目连接：POJ 1325 Machine Schedule]]></description><category></category></item><item><title><![CDATA[POJ 1466 Girls and Boys(匈牙利算法—最大独立集)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28141273</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28141273</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 22:01:04 +0800</pubDate><description><![CDATA[题目链接：POJ 1466 Girls and Boys
最大独立集问题：在Ｎ个点的图G中选出m个点，使这m个点两两之间没有边(没有某种关系)．求m最大值．如果图Ｇ满足二分图条件，则可以用二分图匹配来做．最大独立集点数 = N - 最大匹配数]]></description><category></category></item><item><title><![CDATA[POJ 2536 Gopher II(二分图最大匹配)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28125417</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28125417</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 19:17:08 +0800</pubDate><description><![CDATA[题目链接：POJ 2536 Gopher II
如果某个老鼠neng]]></description><category></category></item><item><title><![CDATA[POJ 1511 Invitation Cards(SPFA)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28117331</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28117331</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 17:52:53 +0800</pubDate><description><![CDATA[题目链接：POJ 1511 Invitation Cards
不会做。。看了大神的博客->]]></description><category></category></item><item><title><![CDATA[POJ 2239 Selecting Courses(二分图最大匹配)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28101771</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28101771</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 13:10:28 +0800</pubDate><description><![CDATA[题目链接：POJ 2239 Selecting Courses]]></description><category></category></item><item><title><![CDATA[POJ 2195 Going Home(KM)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28101635</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28101635</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 13:04:01 +0800</pubDate><description><![CDATA[题目链接：POJ 2195 Going Home]]></description><category></category></item><item><title><![CDATA[HDU 2255 奔小康赚大钱(KM)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28101471</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28101471</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 12:57:16 +0800</pubDate><description><![CDATA[题目链接：HDU 2255 奔小康赚大钱]]></description><category></category></item><item><title><![CDATA[HDU 1163 Eddy's digital Roots(九余数定理)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28101403</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28101403</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 12:54:55 +0800</pubDate><description><![CDATA[题目链接：HDU 1163 Eddy's digital Roots]]></description><category></category></item><item><title><![CDATA[Codeforces 437C  The Child and Toy(贪心)]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28101319</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28101319</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 12:52:48 +0800</pubDate><description><![CDATA[题目连接：Codeforces 437C  The Child and Toy]]></description><category></category></item><item><title><![CDATA[Codeforces 437B The Child and Set]]></title><link>https://blog.youkuaiyun.com/fobdddf/article/details/28099879</link><guid>https://blog.youkuaiyun.com/fobdddf/article/details/28099879</guid><author>fobdddf</author><pubDate>Mon, 02 Jun 2014 12:50:28 +0800</pubDate><description><![CDATA[题目链接：Codeforces 437B The Child and Set
DFS超时，]]></description><category></category></item></channel></rss>