https://blog.youkuaiyun.com/u012198382zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/u012198382/article/details/79369932https://blog.youkuaiyun.com/u012198382/article/details/79369932u012198382Sun, 25 Feb 2018 16:57:25 +0800https://blog.youkuaiyun.com/u012198382/article/details/77232530https://blog.youkuaiyun.com/u012198382/article/details/77232530u012198382Wed, 16 Aug 2017 11:00:35 +0800https://blog.youkuaiyun.com/u012198382/article/details/64907162https://blog.youkuaiyun.com/u012198382/article/details/64907162u012198382Wed, 22 Mar 2017 12:29:44 +0800https://blog.youkuaiyun.com/u012198382/article/details/56291336https://blog.youkuaiyun.com/u012198382/article/details/56291336u012198382Tue, 21 Feb 2017 18:16:15 +0800https://blog.youkuaiyun.com/u012198382/article/details/55271647https://blog.youkuaiyun.com/u012198382/article/details/55271647u012198382Thu, 16 Feb 2017 20:33:24 +0800二叉树中序遍历序列有序则为BST->把有序序列按中序遍历插入树中 2)output层次遍历序列 #include #include #include #include #include #include #include #include #in]]>https://blog.youkuaiyun.com/u012198382/article/details/49907795https://blog.youkuaiyun.com/u012198382/article/details/49907795u012198382Wed, 18 Nov 2015 16:44:54 +0800https://blog.youkuaiyun.com/u012198382/article/details/48706515https://blog.youkuaiyun.com/u012198382/article/details/48706515u012198382Thu, 24 Sep 2015 09:24:17 +0800=a[k].m，当前t就等于a[i].m。r #include #include #include #include ]]>https://blog.youkuaiyun.com/u012198382/article/details/48469439https://blog.youkuaiyun.com/u012198382/article/details/48469439u012198382Tue, 15 Sep 2015 16:25:40 +0800https://blog.youkuaiyun.com/u012198382/article/details/48444405https://blog.youkuaiyun.com/u012198382/article/details/48444405u012198382Mon, 14 Sep 2015 19:36:43 +0800https://blog.youkuaiyun.com/u012198382/article/details/48444321https://blog.youkuaiyun.com/u012198382/article/details/48444321u012198382Mon, 14 Sep 2015 19:33:33 +0800https://blog.youkuaiyun.com/u012198382/article/details/48241125https://blog.youkuaiyun.com/u012198382/article/details/48241125u012198382Sun, 06 Sep 2015 10:44:19 +0800https://blog.youkuaiyun.com/u012198382/article/details/48239703https://blog.youkuaiyun.com/u012198382/article/details/48239703u012198382Sun, 06 Sep 2015 09:11:47 +0800b ?a]]>https://blog.youkuaiyun.com/u012198382/article/details/48174249https://blog.youkuaiyun.com/u012198382/article/details/48174249u012198382Wed, 02 Sep 2015 09:54:01 +0800https://blog.youkuaiyun.com/u012198382/article/details/48160907https://blog.youkuaiyun.com/u012198382/article/details/48160907u012198382Tue, 01 Sep 2015 17:40:29 +0800https://blog.youkuaiyun.com/u012198382/article/details/48154127https://blog.youkuaiyun.com/u012198382/article/details/48154127u012198382Tue, 01 Sep 2015 10:04:14 +08001,1->0)，另一种是查询给定区间内由1组成的子串的最大长度。重点在区间合并和延迟标记。 #include #include #include #include #include #include #include #include #include #include #define INF 0x3fffffff usi]]>https://blog.youkuaiyun.com/u012198382/article/details/48085701https://blog.youkuaiyun.com/u012198382/article/details/48085701u012198382Sat, 29 Aug 2015 10:54:59 +0800https://blog.youkuaiyun.com/u012198382/article/details/48025935https://blog.youkuaiyun.com/u012198382/article/details/48025935u012198382Thu, 27 Aug 2015 12:46:53 +0800MAXN，所以一个数最多只有7个质因子。 #include #include #include #define MAXN 1000010 using namespace std; int isp[MAXN]; int sum[MAXN]]]>https://blog.youkuaiyun.com/u012198382/article/details/47703169https://blog.youkuaiyun.com/u012198382/article/details/47703169u012198382Sun, 16 Aug 2015 16:25:05 +0800https://blog.youkuaiyun.com/u012198382/article/details/46591371https://blog.youkuaiyun.com/u012198382/article/details/46591371u012198382Mon, 22 Jun 2015 09:19:25 +0800https://blog.youkuaiyun.com/u012198382/article/details/45249947https://blog.youkuaiyun.com/u012198382/article/details/45249947u012198382Fri, 24 Apr 2015 18:03:00 +0800