<![CDATA[EverydayIsLife的博客]]>

<![CDATA[EverydayIsLife的博客]]>https://blog.youkuaiyun.com/EverydayIsLifezh-cnhttps://blog.youkuaiyun.com/<![CDATA[判断二叉树是否AVL树]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/79595029https://blog.youkuaiyun.com/EverydayIsLife/article/details/79595029EverydayIsLifeSat, 17 Mar 2018 19:54:19 +0800<![CDATA[Manacher算法求最长回文子串]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/79594976https://blog.youkuaiyun.com/EverydayIsLife/article/details/79594976EverydayIsLifeSat, 17 Mar 2018 19:43:08 +0800<![CDATA[重装windows后无法启动ubuntu解决办法]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/78975695https://blog.youkuaiyun.com/EverydayIsLife/article/details/78975695EverydayIsLifeThu, 04 Jan 2018 21:35:44 +0800<![CDATA[PAT-AL 1039. Course List for Student]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77895499https://blog.youkuaiyun.com/EverydayIsLife/article/details/77895499EverydayIsLifeFri, 08 Sep 2017 15:37:49 +0800<![CDATA[URAL-1103. Pencils and Circles]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77888068https://blog.youkuaiyun.com/EverydayIsLife/article/details/77888068EverydayIsLifeThu, 07 Sep 2017 22:55:04 +0800 #include #define MAXN 5000 struct Point{ double x; d]]><![CDATA[URAL-1101. Robot in the Field]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77887619https://blog.youkuaiyun.com/EverydayIsLife/article/details/77887619EverydayIsLifeThu, 07 Sep 2017 22:06:13 +0800 #include #include #include using namespace std; #define MAXN 100+10 //N,M,K]]><![CDATA[PAT-AL 1033. To Fill or Not to Fill]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77871200https://blog.youkuaiyun.com/EverydayIsLife/article/details/77871200EverydayIsLifeWed, 06 Sep 2017 20:44:13 +0800<![CDATA[PAT-AL 1025. PAT Ranking]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77851064https://blog.youkuaiyun.com/EverydayIsLife/article/details/77851064EverydayIsLifeTue, 05 Sep 2017 14:27:48 +0800<![CDATA[PAT-AL 1013. Battle Over Cities]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77839172https://blog.youkuaiyun.com/EverydayIsLife/article/details/77839172EverydayIsLifeMon, 04 Sep 2017 16:47:26 +0800 #include using namespace std; #define MAXN 1000+10 int N, M; int pre[MAXN]; int block[MAXN];int find(int x); voi]]><![CDATA[HDU-1232 畅通工程]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77838347https://blog.youkuaiyun.com/EverydayIsLife/article/details/77838347EverydayIsLifeMon, 04 Sep 2017 15:53:25 +0800 #include using namespace std; #define MAXN 1000+10 int N, M; int pre[MAXN]; int block[MAXN];int find(int x); voi]]><![CDATA[PAT-AL 1007. Maximum Subsequence Sum]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77837300https://blog.youkuaiyun.com/EverydayIsLife/article/details/77837300EverydayIsLifeMon, 04 Sep 2017 14:40:56 +0800=0，那么temp_sum+=arri；如果temp_sum<0, temp_sum = arr[i]。判断temp_sum 是否大于sum（当前最大子串和）,如果是就更新sum。/*用途： **说明： **算法： *///#define LOCAL #include using nam]]><![CDATA[PAT-AL 1022. Digital Library]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77834535https://blog.youkuaiyun.com/EverydayIsLife/article/details/77834535EverydayIsLifeMon, 04 Sep 2017 10:51:56 +0800 #include #include #include usin]]><![CDATA[算法面试100题——8.逻辑思维题]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77834266https://blog.youkuaiyun.com/EverydayIsLife/article/details/77834266EverydayIsLifeMon, 04 Sep 2017 10:33:40 +0800<![CDATA[算法面试100题——7.微软亚院之编程判断俩个链表是否相交]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77834086https://blog.youkuaiyun.com/EverydayIsLife/article/details/77834086EverydayIsLifeMon, 04 Sep 2017 10:26:47 +0800 #in]]><![CDATA[算法面试100题——4.在二元树中找出和为某一值的所有路径]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833799https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833799EverydayIsLifeMon, 04 Sep 2017 10:13:34 +0800<![CDATA[算法面试100题——2.设计包含min函数的栈]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833657https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833657EverydayIsLifeMon, 04 Sep 2017 10:06:37 +0800 #include using namespace std; #define MAX]]><![CDATA[算法面试100题——1、把二元查找树转变成排序的双向链表]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833581https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833581EverydayIsLifeMon, 04 Sep 2017 10:00:56 +0800<![CDATA[URAL-1451. Beerhouse Tale]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833305https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833305EverydayIsLifeMon, 04 Sep 2017 09:35:31 +0800<![CDATA[PAT-TL 1010. Lehmer Code]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833046https://blog.youkuaiyun.com/EverydayIsLife/article/details/77833046EverydayIsLifeMon, 04 Sep 2017 09:06:28 +0800 #include #include #include using namespace std; #define MAXN]]><![CDATA[PAT-TL 1009. Triple Inversions]]>https://blog.youkuaiyun.com/EverydayIsLife/article/details/77824593https://blog.youkuaiyun.com/EverydayIsLife/article/details/77824593EverydayIsLifeSun, 03 Sep 2017 19:07:46 +0800