https://blog.youkuaiyun.com/Lin_disguiserzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Lin_disguiser/article/details/78784542https://blog.youkuaiyun.com/Lin_disguiser/article/details/78784542Lin_disguiserTue, 12 Dec 2017 18:07:11 +0800 jupyter notebook 但是有一个问题就是import mxnet的时候出现一些错误，但好像没有妨碍运行。 开启深度学习之旅吧！！！！！！]]>https://blog.youkuaiyun.com/Lin_disguiser/article/details/75041879https://blog.youkuaiyun.com/Lin_disguiser/article/details/75041879Lin_disguiserWed, 12 Jul 2017 23:30:09 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/75038081https://blog.youkuaiyun.com/Lin_disguiser/article/details/75038081Lin_disguiserWed, 12 Jul 2017 17:57:09 +0800sources root将当前工作的文件夹加入source_path就可]]>https://blog.youkuaiyun.com/Lin_disguiser/article/details/75007498https://blog.youkuaiyun.com/Lin_disguiser/article/details/75007498Lin_disguiserWed, 12 Jul 2017 11:30:16 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/74936580https://blog.youkuaiyun.com/Lin_disguiser/article/details/74936580Lin_disguiserMon, 10 Jul 2017 21:24:41 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/74854548https://blog.youkuaiyun.com/Lin_disguiser/article/details/74854548Lin_disguiserSat, 08 Jul 2017 23:58:32 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/74783282https://blog.youkuaiyun.com/Lin_disguiser/article/details/74783282Lin_disguiserSat, 08 Jul 2017 01:01:39 +0800莫队算法讲解    这是一篇博客的译文 原文 主要思想在于：对于离线查询，按照朴素的思想复杂度为O(n^2)，但是莫队算法的厉害之处在于只是改]]>https://blog.youkuaiyun.com/Lin_disguiser/article/details/74649309https://blog.youkuaiyun.com/Lin_disguiser/article/details/74649309Lin_disguiserFri, 07 Jul 2017 12:25:30 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/64211579https://blog.youkuaiyun.com/Lin_disguiser/article/details/64211579Lin_disguiserMon, 20 Mar 2017 23:37:07 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/62909040https://blog.youkuaiyun.com/Lin_disguiser/article/details/62909040Lin_disguiserFri, 17 Mar 2017 21:47:34 +0800max_int/10.那么n*10肯定大于max_int了，但是n这时候还没有大于max_int。所以可以通过]]>https://blog.youkuaiyun.com/Lin_disguiser/article/details/62897886https://blog.youkuaiyun.com/Lin_disguiser/article/details/62897886Lin_disguiserFri, 17 Mar 2017 20:26:23 +0800a[i+1]，记为i 2.再次从尾向前扫描，找出第一个a[k]>a[i]，记为k 3.交换a[i]和a[k]]>https://blog.youkuaiyun.com/Lin_disguiser/article/details/60957251https://blog.youkuaiyun.com/Lin_disguiser/article/details/60957251Lin_disguiserThu, 09 Mar 2017 11:52:59 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/60875678https://blog.youkuaiyun.com/Lin_disguiser/article/details/60875678Lin_disguiserWed, 08 Mar 2017 16:54:24 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/60566019https://blog.youkuaiyun.com/Lin_disguiser/article/details/60566019Lin_disguiserMon, 06 Mar 2017 08:43:38 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/54407549https://blog.youkuaiyun.com/Lin_disguiser/article/details/54407549Lin_disguiserFri, 13 Jan 2017 13:08:25 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/54378558https://blog.youkuaiyun.com/Lin_disguiser/article/details/54378558Lin_disguiserThu, 12 Jan 2017 15:39:08 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/54377940https://blog.youkuaiyun.com/Lin_disguiser/article/details/54377940Lin_disguiserThu, 12 Jan 2017 14:54:04 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/54377650https://blog.youkuaiyun.com/Lin_disguiser/article/details/54377650Lin_disguiserThu, 12 Jan 2017 14:50:01 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/54352245https://blog.youkuaiyun.com/Lin_disguiser/article/details/54352245Lin_disguiserWed, 11 Jan 2017 22:56:20 +0800https://blog.youkuaiyun.com/Lin_disguiser/article/details/52329392https://blog.youkuaiyun.com/Lin_disguiser/article/details/52329392Lin_disguiserFri, 26 Aug 2016 16:09:00 +0800