<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Aurora]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/iDaybreak</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; iDaybreak]]></copyright><item><title><![CDATA[POJ题目分类 [转]]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80858964</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80858964</guid><author>iDaybreak</author><pubDate>Fri, 29 Jun 2018 16:44:45 +0800</pubDate><description><![CDATA[大佬博客：传送门初期:一.基本算法:     (1)枚举. (poj1753,poj2965)     (2)贪心(poj1328,poj2109,poj2586)     (3)递归和分治法.     (4)递推.     (5)构造法.(poj3295)     (6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法:     (1)图的深度...]]></description><category></category></item><item><title><![CDATA[最短路 Flyod]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80706157</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80706157</guid><author>iDaybreak</author><pubDate>Fri, 15 Jun 2018 15:35:57 +0800</pubDate><description><![CDATA[最短路 Flyod 时间复杂度 ： n^3(n为点的个数)#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;math.h&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;stack&amp;gt;
#inc]]></description><category></category></item><item><title><![CDATA[Dijkstra 有向图]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80706052</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80706052</guid><author>iDaybreak</author><pubDate>Fri, 15 Jun 2018 15:29:26 +0800</pubDate><description><![CDATA[Dijkstra 有向图#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;math.h&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;stack&amp;gt;
#include&amp;lt;deque]]></description><category></category></item><item><title><![CDATA[Dijkstra 无向图]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80706028</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80706028</guid><author>iDaybreak</author><pubDate>Fri, 15 Jun 2018 15:28:07 +0800</pubDate><description><![CDATA[Dijkstra 无向图#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;math.h&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;stack&amp;gt;
#include&amp;lt;deque]]></description><category></category></item><item><title><![CDATA[Bellman有向图]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80698059</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80698059</guid><author>iDaybreak</author><pubDate>Thu, 14 Jun 2018 20:43:56 +0800</pubDate><description><![CDATA[Bellman有向图#include&amp;lt;stdio.h&amp;gt;
#include&amp;lt;stdlib.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;math.h&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;queue&amp;gt;
#include&amp;lt;stack&amp;gt;
#include&amp;lt;deque&a]]></description><category></category></item><item><title><![CDATA[Bellman无向图]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80698051</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80698051</guid><author>iDaybreak</author><pubDate>Thu, 14 Jun 2018 20:43:01 +0800</pubDate><description><![CDATA[Bellman无向图#include&amp;lt;stdio.h&amp;gt;#include&amp;lt;stdlib.h&amp;gt;#include&amp;lt;string.h&amp;gt;#include&amp;lt;math.h&amp;gt;#include&amp;lt;algorithm&amp;gt;#include&amp;lt;queue&amp;gt;#include&amp;lt;stack&amp;gt;#include&amp;lt;deque&amp;gt;#]]></description><category></category></item><item><title><![CDATA[最小生成树 Prime Kruskal 算法]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80545062</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80545062</guid><author>iDaybreak</author><pubDate>Sat, 02 Jun 2018 08:55:43 +0800</pubDate><description><![CDATA[#include&amp;lt;stdio.h&amp;gt;#include&amp;lt;stdlib.h&amp;gt;#include&amp;lt;string.h&amp;gt;#include&amp;lt;math.h&amp;gt;#include&amp;lt;algorithm&amp;gt;#include&amp;lt;queue&amp;gt;#include&amp;lt;stack&amp;gt;#include&amp;lt;deque&amp;gt;#include&am]]></description><category></category></item><item><title><![CDATA[POJ 1611 The Suspects 并查集 详细题解]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80414387</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80414387</guid><author>iDaybreak</author><pubDate>Wed, 23 May 2018 09:10:24 +0800</pubDate><description><![CDATA[                                                         The SuspectsTime Limit:1000MS    Memory Limit:20000KB    64bit IO Format:%I64d &amp;amp; %I64uDescription  Severe acute respiratory syndrome (SARS)...]]></description><category></category></item><item><title><![CDATA[并查集简单操作及经典例题题解]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80374550</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80374550</guid><author>iDaybreak</author><pubDate>Sat, 19 May 2018 15:26:11 +0800</pubDate><description><![CDATA[并查集包括并和查两部分。实际操作中有三个函数与两个数组构成。

两个数组：int deep[N]    //用来存储该门派的树的深度





        int captain[n]  //用来存储n的上级是谁







三个函数：

1、初始化函数







void init(int n)

{

    int i,j...]]></description><category></category></item><item><title><![CDATA[第九届山东省ACM竞赛总结]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80296577</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80296577</guid><author>iDaybreak</author><pubDate>Sun, 13 May 2018 07:44:46 +0800</pubDate><description><![CDATA[                                           第九届山东省ACM竞赛总结     时间飞逝，转眼间大一已经接近尾声了，我仍然记得刚开学时对ACM的崇敬之情，当时为能否进ACM而担心，然后为能否留在ACM而担心，后来为能否参加省赛而担心。     备战省赛。首先，我要感谢集训队的师哥们，我能感受到师哥们对这次省赛的看重，因为这会成为许多师哥的退役赛，在这样的情...]]></description><category></category></item><item><title><![CDATA[HDU - 6025     Coprime Sequence]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80186794</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80186794</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 21:26:01 +0800</pubDate><description><![CDATA[                                            Coprime SequenceDo you know what is called ``Coprime Sequence''? That is a sequence consists of n positive integers, and the GCD (Greatest Common Divisor) o...]]></description><category></category></item><item><title><![CDATA[Marjar Cola]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80184860</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80184860</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 19:10:59 +0800</pubDate><description><![CDATA[                                                        Marjar ColaMarjar Cola is on sale now! In order to attract more customers, Edward, the boss of Marjar Company, decides to launch a promotion: If...]]></description><category></category></item><item><title><![CDATA[Intervals]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80182138</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80182138</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 16:48:46 +0800</pubDate><description><![CDATA[                                                                  Intervals Chiaki has n intervals and the i-th of them is [li, ri]. She wants to delete some intervals so that there does not exist thr...]]></description><category></category></item><item><title><![CDATA[Log Files]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80180526</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80180526</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 15:27:03 +0800</pubDate><description><![CDATA[                                                                    Log Files                Nikolay has decided to become the best programmer in the world! Now he regularly takes part in various prog...]]></description><category></category></item><item><title><![CDATA[Linearization of the kernel functions in SVM]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80174758</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80174758</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 09:01:16 +0800</pubDate><description><![CDATA[                        Linearization of the kernel functions in SVM  SVM（Support Vector Machine）is an important classification tool, which has a wide range of applications in cluster analysis, commun...]]></description><category></category></item><item><title><![CDATA[HDU  Game with Pearls]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80174638</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80174638</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 08:49:53 +0800</pubDate><description><![CDATA[                                                Game with Pearls  Tom and Jerry are playing a game with tubes and pearls. The rule of the game is:   1) Tom and Jerry come up together with a number K. ...]]></description><category></category></item><item><title><![CDATA[Tic-Tac-Toe]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80174633</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80174633</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 08:37:39 +0800</pubDate><description><![CDATA[ Tic-Tac-Toe Kim likes to play Tic-Tac-Toe. Given a current state, and now Kim is going to take his next move. Please tell Kim if he can win the game in next 2 moves if both player are clever enough. ...]]></description><category></category></item><item><title><![CDATA[Game]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80174507</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80174507</guid><author>iDaybreak</author><pubDate>Thu, 03 May 2018 08:32:06 +0800</pubDate><description><![CDATA[                                                                                 Game                                            Time limit  1000 ms              Memory limit262144 kB                 ...]]></description><category></category></item><item><title><![CDATA[第四届趣味编程大赛  小国的游戏]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80074186</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80074186</guid><author>iDaybreak</author><pubDate>Wed, 25 Apr 2018 09:19:32 +0800</pubDate><description><![CDATA[小国的游戏Time Limit: 1 Sec  Memory Limit: 64 MBSubmit: 91  Solved: 24[Submit][Status][Discuss]Description可怜的小国和小辉在双十一过后，吃饭都吃不起了，只能在吃饭时间玩会游戏来打发时间。可是时间久了之后，他们各种游戏都玩了一遍，所以他们两个打算合作出一个新奇的游戏。最终，他们决定先做四个纸箱，每个纸箱里...]]></description><category></category></item><item><title><![CDATA[CF  Mirrored String II]]></title><link>https://blog.youkuaiyun.com/iDaybreak/article/details/80073981</link><guid>https://blog.youkuaiyun.com/iDaybreak/article/details/80073981</guid><author>iDaybreak</author><pubDate>Wed, 25 Apr 2018 09:06:10 +0800</pubDate><description><![CDATA[I. Mirrored String IItime limit per test1.0 smemory limit per test256 MBinputstandard inputoutputstandard outputNote: this is a harder version of Mirrored string I.The gorillas have recently discovere...]]></description><category></category></item></channel></rss>