https://blog.youkuaiyun.com/losteronlyzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/losteronly/article/details/51537153https://blog.youkuaiyun.com/losteronly/article/details/51537153losteronlyMon, 30 May 2016 13:09:20 +0800https://blog.youkuaiyun.com/losteronly/article/details/51308897https://blog.youkuaiyun.com/losteronly/article/details/51308897losteronlyWed, 04 May 2016 00:23:15 +0800 using namespace std; int main() { cout << "My Hello World"; cout << endl; return 10; }三、使用]]>https://blog.youkuaiyun.com/losteronly/article/details/51246896https://blog.youkuaiyun.com/losteronly/article/details/51246896losteronlyMon, 25 Apr 2016 23:59:18 +0800https://blog.youkuaiyun.com/losteronly/article/details/51138552https://blog.youkuaiyun.com/losteronly/article/details/51138552losteronlyTue, 12 Apr 2016 23:52:10 +0800 namespace MyAlgorit]]>https://blog.youkuaiyun.com/losteronly/article/details/51137482https://blog.youkuaiyun.com/losteronly/article/details/51137482losteronlyTue, 12 Apr 2016 21:39:17 +0800https://blog.youkuaiyun.com/losteronly/article/details/51118473https://blog.youkuaiyun.com/losteronly/article/details/51118473losteronlyMon, 11 Apr 2016 00:44:25 +0800https://blog.youkuaiyun.com/losteronly/article/details/51116026https://blog.youkuaiyun.com/losteronly/article/details/51116026losteronlySun, 10 Apr 2016 22:49:56 +0800 log = LogInfo(); T key;]]>https://blog.youkuaiyun.com/losteronly/article/details/51069295https://blog.youkuaiyun.com/losteronly/article/details/51069295losteronlyTue, 05 Apr 2016 23:35:37 +0800https://blog.youkuaiyun.com/losteronly/article/details/51061888https://blog.youkuaiyun.com/losteronly/article/details/51061888losteronlyTue, 05 Apr 2016 01:57:39 +0800https://blog.youkuaiyun.com/losteronly/article/details/51059254https://blog.youkuaiyun.com/losteronly/article/details/51059254losteronlyMon, 04 Apr 2016 22:45:39 +0800https://blog.youkuaiyun.com/losteronly/article/details/51048724https://blog.youkuaiyun.com/losteronly/article/details/51048724losteronlySun, 03 Apr 2016 02:24:23 +0800https://blog.youkuaiyun.com/losteronly/article/details/51046400https://blog.youkuaiyun.com/losteronly/article/details/51046400losteronlySun, 03 Apr 2016 00:34:57 +0800https://blog.youkuaiyun.com/losteronly/article/details/50994744https://blog.youkuaiyun.com/losteronly/article/details/50994744losteronlySun, 27 Mar 2016 23:13:27 +0800https://blog.youkuaiyun.com/losteronly/article/details/50975824https://blog.youkuaiyun.com/losteronly/article/details/50975824losteronlyThu, 24 Mar 2016 22:29:56 +0800https://blog.youkuaiyun.com/losteronly/article/details/50959808https://blog.youkuaiyun.com/losteronly/article/details/50959808losteronlyWed, 23 Mar 2016 00:19:21 +0800=A[2i],A[i]>=A[2*i+1],则该序列称为大顶堆或者最大堆。反之则成为最小堆。 堆筛选或堆调整: 从最后一个叶子结点开始筛选出该节点的兄弟结点与父节点中最大或最小的元素与父节点交换。 建堆算法证明： 第一步：i=N/2时，i+1,..N都是叶节点，]]>https://blog.youkuaiyun.com/losteronly/article/details/50938193https://blog.youkuaiyun.com/losteronly/article/details/50938193losteronlySun, 20 Mar 2016 19:48:58 +0800https://blog.youkuaiyun.com/losteronly/article/details/50909465https://blog.youkuaiyun.com/losteronly/article/details/50909465losteronlyWed, 16 Mar 2016 23:12:16 +0800https://blog.youkuaiyun.com/losteronly/article/details/50901586https://blog.youkuaiyun.com/losteronly/article/details/50901586losteronlyWed, 16 Mar 2016 01:13:49 +0800https://blog.youkuaiyun.com/losteronly/article/details/50890899https://blog.youkuaiyun.com/losteronly/article/details/50890899losteronlyMon, 14 Mar 2016 23:29:37 +0800https://blog.youkuaiyun.com/losteronly/article/details/50443620https://blog.youkuaiyun.com/losteronly/article/details/50443620losteronlyThu, 31 Dec 2015 20:28:29 +0800