<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[幻想の天地]]></title><description><![CDATA[oi笔记本]]></description><link>https://blog.youkuaiyun.com/fstephen</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fstephen]]></copyright><item><title><![CDATA[[最小路径覆盖、二分图最大匹配]Pku3020--Antenna Placement]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5307539</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5307539</guid><author>fstephen</author><pubDate>Fri, 12 Feb 2010 15:00:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=3020  Antenna PlacementTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2319 Accepted: 1082Description]]></description><category></category></item><item><title><![CDATA[[转]二分图最大匹配总结]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5307493</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5307493</guid><author>fstephen</author><pubDate>Fri, 12 Feb 2010 14:32:00 +0800</pubDate><description><![CDATA[转自：http://zc634579757.blog.163.com/blog/static/12449746220098272176148/ 1。一个二分图中的最大匹配数等于这个图中的最小点覆盖数【转自Matirx67】König 定理是一个二分图中很重要的定理，它的意思是，一个二分图中的最大匹配数等于这个图中的最小点覆盖数。如果你还不知道什么是最小点覆盖，我也在这里说一 下：假]]></description><category></category></item><item><title><![CDATA[[最大匹配]Pku3041--Asteroids]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5307482</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5307482</guid><author>fstephen</author><pubDate>Fri, 12 Feb 2010 14:26:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=3041 AsteroidsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4643 Accepted: 2410DescriptionBessie want]]></description><category></category></item><item><title><![CDATA[[动态规划]Pku3377--Ferry Lanes]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5306557</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5306557</guid><author>fstephen</author><pubDate>Thu, 11 Feb 2010 15:50:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=3377 Ferry LanesTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 2563 Accepted: 510Description]]></description><category></category></item><item><title><![CDATA[[并查集]Pku1703--Find them,Catch them]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5286368</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5286368</guid><author>fstephen</author><pubDate>Wed, 03 Feb 2010 20:35:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=1703 Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11242 Accepted: 3219Description]]></description><category></category></item><item><title><![CDATA[[动态规划]Pku1160--Post Office]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5280564</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5280564</guid><author>fstephen</author><pubDate>Tue, 02 Feb 2010 14:26:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=1160 Post OfficeTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7581 Accepted: 4018DescriptionThere is a ]]></description><category></category></item><item><title><![CDATA[[动态规划]Pku1159--Palindrome]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5280459</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5280459</guid><author>fstephen</author><pubDate>Tue, 02 Feb 2010 14:00:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=1159 PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 27432 Accepted: 9174DescriptionA palindrom]]></description><category></category></item><item><title><![CDATA[[数学-欧拉函数]Pku2478--Farey Sequence]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5277562</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5277562</guid><author>fstephen</author><pubDate>Mon, 01 Feb 2010 16:18:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=2478 Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5575 Accepted: 1998DescriptionThe Fare]]></description><category></category></item><item><title><![CDATA[[数学-farey序列]Pku3374--Cake Share]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5277422</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5277422</guid><author>fstephen</author><pubDate>Mon, 01 Feb 2010 15:45:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=3374 Cake ShareTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2836 Accepted: 700DescriptionUpdog pre]]></description><category></category></item><item><title><![CDATA[[RMQ]Pku3368-Frequent values]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5277226</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5277226</guid><author>fstephen</author><pubDate>Mon, 01 Feb 2010 15:03:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=3368 Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4431 Accepted: 1554DescriptionYou a]]></description><category></category></item><item><title><![CDATA[[拓展欧几里得算法]Pku1061-青蛙的约会]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5277045</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5277045</guid><author>fstephen</author><pubDate>Mon, 01 Feb 2010 14:30:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=1061 青蛙的约会Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 43622 Accepted: 6240Description两只青蛙在网上相识了，它们聊得很]]></description><category></category></item><item><title><![CDATA[同余运算性质]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5276548</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5276548</guid><author>fstephen</author><pubDate>Mon, 01 Feb 2010 11:33:00 +0800</pubDate><description><![CDATA[ 100除以7的余数是2，意思就是说把100个东西七个七个分成一组的话最后还剩2个。余数有一个严格的定义：假如被除数是a，除数是b（假设它们均为正整数），那么我们总能够找到一个小于b的自然数r和一个整数m，使得a=bm+r。这个r就是a除以b的余数，m被称作商。我们经常用mod来表示取余，a除以b余r就写成a mod b = r。    如果两个数a和b之差能被m整除，那么我们就说a和b对模数m同]]></description><category></category></item><item><title><![CDATA[Pku 3372]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5169420</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5169420</guid><author>fstephen</author><pubDate>Sun, 10 Jan 2010 14:41:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=3372 Candy DistributionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3758 Accepted: 1938Description]]></description><category></category></item><item><title><![CDATA[[最短路]pku2387-Til the Cows Come Home]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5168901</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5168901</guid><author>fstephen</author><pubDate>Sun, 10 Jan 2010 12:25:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=2387  Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8663 Accepted: 2864Descriptio]]></description><category></category></item><item><title><![CDATA[[最短路spfa]pku1511-Invitation Cards]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5168837</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5168837</guid><author>fstephen</author><pubDate>Sun, 10 Jan 2010 12:04:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=1511 Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 5784 Accepted: 1616DescriptionIn th]]></description><category></category></item><item><title><![CDATA[[计算几何]Pku2079-Triangle]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5168477</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5168477</guid><author>fstephen</author><pubDate>Sun, 10 Jan 2010 10:36:00 +0800</pubDate><description><![CDATA[TriangleTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 3978 Accepted: 1085DescriptionGiven n distinct points on a plane, your task is to find the triangl]]></description><category></category></item><item><title><![CDATA[[计算几何-凸包]pku1113-Wall]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5168294</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5168294</guid><author>fstephen</author><pubDate>Sun, 10 Jan 2010 09:38:00 +0800</pubDate><description><![CDATA[题目：没仔细看，只知道是求凸包+圆的面积- -分析：没啥好分析的。注：借此题复习了下凸包..发现自己忘得真厉害，尤其是用叉积判断转向..完全弄反了。叉积的时候p1和p2的先后也会影响结果。因为这个小细节郁闷了好久= = 糟糕的codes: type  point=record x,y:longint; end;var  n,l:longint;  a:arr]]></description><category></category></item><item><title><![CDATA[[AC自动机+dp]PKU 3691--DNA repair]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5157069</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5157069</guid><author>fstephen</author><pubDate>Fri, 08 Jan 2010 12:05:00 +0800</pubDate><description><![CDATA[http://acm.pku.edu.cn/JudgeOnline/problem?id=3691DNA repairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1469 Accepted: 650DescriptionBiologists f]]></description><category></category></item><item><title><![CDATA[[ac自动机]zoj3228 Searching the String]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5146292</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5146292</guid><author>fstephen</author><pubDate>Wed, 06 Jan 2010 22:26:00 +0800</pubDate><description><![CDATA[Searching the StringTime Limit: 7 Seconds      Memory Limit: 129872 KB Little jay really hates to deal with string. But moondy likes it very much, and shes so mischievous that she often gives]]></description><category></category></item><item><title><![CDATA[[AC自动机]hdu2222 Keywords Search ]]></title><link>https://blog.youkuaiyun.com/fstephen/article/details/5124577</link><guid>https://blog.youkuaiyun.com/fstephen/article/details/5124577</guid><author>fstephen</author><pubDate>Sun, 03 Jan 2010 15:23:00 +0800</pubDate><description><![CDATA[Keywords SearchTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3406    Accepted Submission(s): 1177Problem DescriptionIn]]></description><category></category></item></channel></rss>