<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[yjCola]]></title><description><![CDATA[Calm down and go ahead.]]></description><link>https://blog.youkuaiyun.com/fallenfall</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fallenfall]]></copyright><item><title><![CDATA[反转单链表]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/47320327</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/47320327</guid><author>fallenfall</author><pubDate>Thu, 06 Aug 2015 17:32:01 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

struct ListNode {
    int val;
    ListNode *next;
	ListNode(){};
    ListNode(int x) :]]></description><category></category></item><item><title><![CDATA[zoj 3195 Design the city(LCA)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/40263943</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/40263943</guid><author>fallenfall</author><pubDate>Sun, 19 Oct 2014 16:53:31 +0800</pubDate><description><![CDATA[zoj 3195 Design the city



shu'shang]]></description><category></category></item><item><title><![CDATA[hdu 2874 Connections between cities(LCA)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/40263557</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/40263557</guid><author>fallenfall</author><pubDate>Sun, 19 Oct 2014 16:19:31 +0800</pubDate><description><![CDATA[hdu 2874 Connections between cities]]></description><category></category></item><item><title><![CDATA[poj 1986 Distance Queries(LCA)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/40262921</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/40262921</guid><author>fallenfall</author><pubDate>Sun, 19 Oct 2014 15:17:23 +0800</pubDate><description><![CDATA[poj 1986 Distance Queries



he]]></description><category></category></item><item><title><![CDATA[poj 1470 Closest Common Ancestors(LCA)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/40262105</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/40262105</guid><author>fallenfall</author><pubDate>Sun, 19 Oct 2014 13:38:11 +0800</pubDate><description><![CDATA[poj 1470 Closest Common Ancestors



基础的LCA，但是输入ha]]></description><category></category></item><item><title><![CDATA[hdu 2586 How far away ？(LCA)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/40213437</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/40213437</guid><author>fallenfall</author><pubDate>Sat, 18 Oct 2014 18:24:44 +0800</pubDate><description><![CDATA[hdu 2586 How far away ？



根节点]]></description><category></category></item><item><title><![CDATA[The 2014 ACM-ICPC Asia Mudanjiang Regional Contest - K Known Notation]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/40019155</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/40019155</guid><author>fallenfall</author><pubDate>Sun, 12 Oct 2014 16:29:49 +0800</pubDate><description><![CDATA[*号能运算时必须栈里至少you]]></description><category></category></item><item><title><![CDATA[hdu 4557 非诚勿扰(平衡树方法)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/39999189</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/39999189</guid><author>fallenfall</author><pubDate>Sat, 11 Oct 2014 20:30:44 +0800</pubDate><description><![CDATA[hdu 4557 非诚勿扰



本题数据小，可暴力水g]]></description><category></category></item><item><title><![CDATA[poj 3481 Double Queue(平衡树，SBT)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/39993249</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/39993249</guid><author>fallenfall</author><pubDate>Sat, 11 Oct 2014 14:05:26 +0800</pubDate><description><![CDATA[poj 3481 Double Queue



平衡树模板题，练手]]></description><category></category></item><item><title><![CDATA[The end...]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/38920393</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/38920393</guid><author>fallenfall</author><pubDate>Fri, 29 Aug 2014 10:06:16 +0800</pubDate><description><![CDATA[The end with sorrow and happiness...
Best wishes to ACMers]]></description><category></category></item><item><title><![CDATA[poj 3361 Gaussian Prime Factors(求高斯素数约数)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/38357043</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/38357043</guid><author>fallenfall</author><pubDate>Sun, 03 Aug 2014 12:50:59 +0800</pubDate><description><![CDATA[poj 3361 Gaussian Prime Factors



题目要求]]></description><category></category></item><item><title><![CDATA[poj 3421 X-factor Chains(分解质因数+组合数学)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/38351831</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/38351831</guid><author>fallenfall</author><pubDate>Sat, 02 Aug 2014 21:34:35 +0800</pubDate><description><![CDATA[幂和的阶乘/幂阶乘的和]]></description><category></category></item><item><title><![CDATA[poj 3604 Professor Ben(质因数分解)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/38350219</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/38350219</guid><author>fallenfall</author><pubDate>Sat, 02 Aug 2014 18:08:30 +0800</pubDate><description><![CDATA[poj 3604 Professor Ben]]></description><category></category></item><item><title><![CDATA[poj 3696 The Luckiest number(欧拉函数)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/38349793</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/38349793</guid><author>fallenfall</author><pubDate>Sat, 02 Aug 2014 17:21:43 +0800</pubDate><description><![CDATA[poj 3696 The Luckiest number



由题有
8]]></description><category></category></item><item><title><![CDATA[hdu 3642 Get The Treasury(扫描线、立方体交)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/37567145</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/37567145</guid><author>fallenfall</author><pubDate>Tue, 08 Jul 2014 16:39:42 +0800</pubDate><description><![CDATA[hdu 3642 Get The Treasury



和]]></description><category></category></item><item><title><![CDATA[hdu 3255 Farming(扫描线、求立方体交)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/37528949</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/37528949</guid><author>fallenfall</author><pubDate>Mon, 07 Jul 2014 18:43:43 +0800</pubDate><description><![CDATA[hdu 3255 Farming



纠结了几个小时，不过还是很值得的，x]]></description><category></category></item><item><title><![CDATA[poj 1436 Horizontally Visible Segments(线段树)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/36892337</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/36892337</guid><author>fallenfall</author><pubDate>Fri, 04 Jul 2014 15:09:33 +0800</pubDate><description><![CDATA[poj 1436 Horizontally Visible Segments



太暴力了、、


#include
#include
#include
using namespace std;
#define MAXN 8005
#define lch p<<1
#define rch p<<1|1
#define mid (t[p].l+t[p].r)>>1
struct no]]></description><category></category></item><item><title><![CDATA[hdu 3308 LCIS(区间合并)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/36673741</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/36673741</guid><author>fallenfall</author><pubDate>Thu, 03 Jul 2014 17:25:20 +0800</pubDate><description><![CDATA[hdu 3308 LCIS]]></description><category></category></item><item><title><![CDATA[CF 46D Parking Lot(区间合并)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/36656479</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/36656479</guid><author>fallenfall</author><pubDate>Thu, 03 Jul 2014 14:29:33 +0800</pubDate><description><![CDATA[这个题和Hotel差不多
把整个shu]]></description><category></category></item><item><title><![CDATA[poj 2481 Cows(线段树)]]></title><link>https://blog.youkuaiyun.com/fallenfall/article/details/36634007</link><guid>https://blog.youkuaiyun.com/fallenfall/article/details/36634007</guid><author>fallenfall</author><pubDate>Thu, 03 Jul 2014 11:27:28 +0800</pubDate><description><![CDATA[poj 2481 Cows]]></description><category></category></item></channel></rss>