https://blog.youkuaiyun.com/Dakuan_chenzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Dakuan_chen/article/details/76164684https://blog.youkuaiyun.com/Dakuan_chen/article/details/76164684Dakuan_chenWed, 26 Jul 2017 20:10:48 +0800 #include #include #include enum FL]]>https://blog.youkuaiyun.com/Dakuan_chen/article/details/76163939https://blog.youkuaiyun.com/Dakuan_chen/article/details/76163939Dakuan_chenWed, 26 Jul 2017 19:49:31 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/74964882https://blog.youkuaiyun.com/Dakuan_chen/article/details/74964882Dakuan_chenTue, 11 Jul 2017 14:28:21 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/74230814https://blog.youkuaiyun.com/Dakuan_chen/article/details/74230814Dakuan_chenMon, 03 Jul 2017 17:27:56 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/74080723https://blog.youkuaiyun.com/Dakuan_chen/article/details/74080723Dakuan_chenSat, 01 Jul 2017 22:11:50 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73921004https://blog.youkuaiyun.com/Dakuan_chen/article/details/73921004Dakuan_chenThu, 29 Jun 2017 17:43:45 +0800 #include #include #include #include #include #include #include #include #define MAX]]>https://blog.youkuaiyun.com/Dakuan_chen/article/details/73920965https://blog.youkuaiyun.com/Dakuan_chen/article/details/73920965Dakuan_chenThu, 29 Jun 2017 17:40:35 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73864704https://blog.youkuaiyun.com/Dakuan_chen/article/details/73864704Dakuan_chenWed, 28 Jun 2017 22:28:06 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73741444https://blog.youkuaiyun.com/Dakuan_chen/article/details/73741444Dakuan_chenMon, 26 Jun 2017 16:38:57 +0800 #include #include #include #include #include #include void usage(char* arg) { printf("%s [server_ip]]>https://blog.youkuaiyun.com/Dakuan_chen/article/details/73694159https://blog.youkuaiyun.com/Dakuan_chen/article/details/73694159Dakuan_chenSat, 24 Jun 2017 19:17:55 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73611794https://blog.youkuaiyun.com/Dakuan_chen/article/details/73611794Dakuan_chenThu, 22 Jun 2017 22:34:45 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73499655https://blog.youkuaiyun.com/Dakuan_chen/article/details/73499655Dakuan_chenTue, 20 Jun 2017 16:13:17 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73331279https://blog.youkuaiyun.com/Dakuan_chen/article/details/73331279Dakuan_chenFri, 16 Jun 2017 14:40:19 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73188249https://blog.youkuaiyun.com/Dakuan_chen/article/details/73188249Dakuan_chenTue, 13 Jun 2017 16:45:46 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/73006314https://blog.youkuaiyun.com/Dakuan_chen/article/details/73006314Dakuan_chenSat, 10 Jun 2017 20:18:42 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/72933863https://blog.youkuaiyun.com/Dakuan_chen/article/details/72933863Dakuan_chenFri, 09 Jun 2017 11:26:51 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/72911422https://blog.youkuaiyun.com/Dakuan_chen/article/details/72911422Dakuan_chenThu, 08 Jun 2017 11:11:42 +0800https://blog.youkuaiyun.com/Dakuan_chen/article/details/72885106https://blog.youkuaiyun.com/Dakuan_chen/article/details/72885106Dakuan_chenTue, 06 Jun 2017 16:58:59 +08000(1<=i<=n)。若T是一棵有n个叶结点的二叉树，而且将权值w1,w2,w3…wn分别赋值给T的n个叶结点，则称T是权值为w1,w2,w3…wn的扩充二叉树。带有权值的叶节点叫着扩充二叉树的外结点，其余不带权值的分支结点叫做内结点。外结点的带权路径长度为T的根节点到该结点的路径长度与该结点上的权值的乘积。n个外结点的扩充二叉树]]>https://blog.youkuaiyun.com/Dakuan_chen/article/details/72884960https://blog.youkuaiyun.com/Dakuan_chen/article/details/72884960Dakuan_chenTue, 06 Jun 2017 16:47:43 +0800= K2*i+1 且 Ki >= K2*i+2) i = 0，1，2…，则称这个堆为最小堆(或最大堆)。 大堆：根节点的关键字大于其他所有节点的关键字它的左右子树也满足这个性质 小堆：根节点的关键字小]]>https://blog.youkuaiyun.com/Dakuan_chen/article/details/72877139https://blog.youkuaiyun.com/Dakuan_chen/article/details/72877139Dakuan_chenTue, 06 Jun 2017 16:35:05 +0800