<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[江上白衣凌云]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ahjkl007</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ahjkl007]]></copyright><item><title><![CDATA[Sublime Text mac 下执行C++]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/42227709</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/42227709</guid><author>ahjkl007</author><pubDate>Mon, 29 Dec 2014 01:09:26 +0800</pubDate><description><![CDATA[大概ST3下面是找不到C++build文件了
但是从stackoverflow上面得知在2下可以找到这个文件 然后插入一段终端运行的命令即可
然后重新下载了ST2 果真可以找到
完成后全文如下{
	"cmd": ["g++", "${file}", "-o", "${file_path}/${file_base_name}"],
	"file_regex": "^(..[^:]*):([0-]]></description><category></category></item><item><title><![CDATA[hdu4478 dfs＋记忆化]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/41108419</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/41108419</guid><author>ahjkl007</author><pubDate>Fri, 14 Nov 2014 02:54:52 +0800</pubDate><description><![CDATA[要求的两个人每一步最优的博弈 那么再某种状态下 当前步人所能zou]]></description><category></category></item><item><title><![CDATA[hdu5101 线段树做法]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/41018821</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/41018821</guid><author>ahjkl007</author><pubDate>Tue, 11 Nov 2014 21:30:35 +0800</pubDate><description><![CDATA[要从从n个集合里面找出两个权值之和大于k的数 问zon]]></description><category></category></item><item><title><![CDATA[决策树笔记]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/40965621</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/40965621</guid><author>ahjkl007</author><pubDate>Mon, 10 Nov 2014 16:48:25 +0800</pubDate><description><![CDATA[首先要引入信息熵的概念 就是]]></description><category></category></item><item><title><![CDATA[KNN 的简易实现 笔记]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/40896431</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/40896431</guid><author>ahjkl007</author><pubDate>Fri, 07 Nov 2014 17:54:55 +0800</pubDate><description><![CDATA[书上有一部分的变量名字很长 然后偷换了一下 就变成了比较容易懂的了
z]]></description><category></category></item><item><title><![CDATA[acdream1242 水BFS]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39882325</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39882325</guid><author>ahjkl007</author><pubDate>Wed, 08 Oct 2014 01:31:30 +0800</pubDate><description><![CDATA[题意：就是很简单路径寻找 然后而外的1要求时]]></description><category></category></item><item><title><![CDATA[acdream 1427后缀数组]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39834771</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39834771</guid><author>ahjkl007</author><pubDate>Mon, 06 Oct 2014 23:02:20 +0800</pubDate><description><![CDATA[题意：求一个串中不重叠出现两次以上的子串的数量
解法：d]]></description><category></category></item><item><title><![CDATA[acdream 1427]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39834443</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39834443</guid><author>ahjkl007</author><pubDate>Mon, 06 Oct 2014 22:44:15 +0800</pubDate><description><![CDATA[解法：线段树单点更新 qu ji]]></description><category></category></item><item><title><![CDATA[BZOJ 2002 LCT]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39787221</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39787221</guid><author>ahjkl007</author><pubDate>Sun, 05 Oct 2014 00:08:16 +0800</pubDate><description><![CDATA[题意：等一等 这个是中文题啊
解法：]]></description><category></category></item><item><title><![CDATA[BZOJ 1036 树链剖分]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39772273</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39772273</guid><author>ahjkl007</author><pubDate>Sat, 04 Oct 2014 03:11:17 +0800</pubDate><description><![CDATA[题意：之前写过lct版本的这个 就是点qi]]></description><category></category></item><item><title><![CDATA[acdream 1218 DFA＋DP]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39759375</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39759375</guid><author>ahjkl007</author><pubDate>Fri, 03 Oct 2014 21:22:29 +0800</pubDate><description><![CDATA[题意：有一个df a
解法：]]></description><category></category></item><item><title><![CDATA[acdream 1220 哈夫曼树]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39759299</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39759299</guid><author>ahjkl007</author><pubDate>Fri, 03 Oct 2014 21:17:16 +0800</pubDate><description><![CDATA[题意：求哈夫曼树的带权路径长度
解法：z j]]></description><category></category></item><item><title><![CDATA[acdream 1214 矩阵快速幂]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39723297</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39723297</guid><author>ahjkl007</author><pubDate>Wed, 01 Oct 2014 23:05:57 +0800</pubDate><description><![CDATA[题意：宽度从1到5的矩阵 然后进行染色 要求ran]]></description><category></category></item><item><title><![CDATA[zoj2319 线段树]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39720047</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39720047</guid><author>ahjkl007</author><pubDate>Wed, 01 Oct 2014 19:59:04 +0800</pubDate><description><![CDATA[题意：求二维都严格上升的最长上升自序列的长度 并输出任意解
解法：]]></description><category></category></item><item><title><![CDATA[hdu4718 RK]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39699477</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39699477</guid><author>ahjkl007</author><pubDate>Tue, 30 Sep 2014 20:37:02 +0800</pubDate><description><![CDATA[题意：求算有多少个长度为m＊l的zi chuan]]></description><category></category></item><item><title><![CDATA[hdu5052 LCT]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39674695</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39674695</guid><author>ahjkl007</author><pubDate>Mon, 29 Sep 2014 20:07:08 +0800</pubDate><description><![CDATA[题意:给定每一个节点的权值]]></description><category></category></item><item><title><![CDATA[hdu5057  树状数组]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39670725</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39670725</guid><author>ahjkl007</author><pubDate>Mon, 29 Sep 2014 15:41:52 +0800</pubDate><description><![CDATA[题意:给出一个序列 然后操作是询问在某一个区间中]]></description><category></category></item><item><title><![CDATA[bzoj 3687 bitset]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39669913</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39669913</guid><author>ahjkl007</author><pubDate>Mon, 29 Sep 2014 15:00:09 +0800</pubDate><description><![CDATA[题意：求n个数构成的序列z]]></description><category></category></item><item><title><![CDATA[bzoj 1798 线段树]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39595501</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39595501</guid><author>ahjkl007</author><pubDate>Sat, 27 Sep 2014 00:48:48 +0800</pubDate><description><![CDATA[题意:维护序列的和 有两个操作 第一个是给一段数字加上一个值 第二个是给一段数字]]></description><category></category></item><item><title><![CDATA[hdu4010 LCT]]></title><link>https://blog.youkuaiyun.com/ahjkl007/article/details/39582129</link><guid>https://blog.youkuaiyun.com/ahjkl007/article/details/39582129</guid><author>ahjkl007</author><pubDate>Fri, 26 Sep 2014 16:27:08 +0800</pubDate><description><![CDATA[题意：点权动态树 要求的操作有cut link 然后询问两点之间的路径上的最大值]]></description><category></category></item></channel></rss>