<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LaddC的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LaddC</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LaddC]]></copyright><item><title><![CDATA[06-图3 六度空间 (30分)]]></title><link>https://blog.youkuaiyun.com/LaddC/article/details/107203170</link><guid>https://blog.youkuaiyun.com/LaddC/article/details/107203170</guid><author>LaddC</author><pubDate>Wed, 08 Jul 2020 12:39:57 +0800</pubDate><description><![CDATA[“六度空间”理论又称作“六度分隔（Six Degrees of Separation）”理论。这个理论可以通俗地阐述为：“你和任何一个陌生人之间所间隔的人不会超过六个，也就是说，最多通过五个人你就能够认识任何一个陌生人。”如图1所示。

图1 六度空间示意图
“六度空间”理论虽然得到广泛的认同，并且正在得到越来越多的应用。但是数十年来，试图验证这个理论始终是许多社会学家努力追求的目标。然而由于历史的原因，这样的研究具有太大的局限性和困难。随着当代人的联络主要依赖于电话、短信、微信以及因特网上即时通信等工具，]]></description><category></category></item><item><title><![CDATA[05-树9 Huffman Codes (30分)]]></title><link>https://blog.youkuaiyun.com/LaddC/article/details/107130542</link><guid>https://blog.youkuaiyun.com/LaddC/article/details/107130542</guid><author>LaddC</author><pubDate>Sat, 04 Jul 2020 21:33:38 +0800</pubDate><description><![CDATA[05-树9 Huffman Codes (30分)
In 1953, David A. Huffman published his paper “A Method for the Construction of Minimum-Redundancy Codes”, and hence printed his name in the history of computer science. As a professor who gives the final exam problem on Huffman c]]></description><category></category></item><item><title><![CDATA[05-树8 File Transfer (25分)]]></title><link>https://blog.youkuaiyun.com/LaddC/article/details/107127397</link><guid>https://blog.youkuaiyun.com/LaddC/article/details/107127397</guid><author>LaddC</author><pubDate>Sat, 04 Jul 2020 17:25:53 +0800</pubDate><description><![CDATA[We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any computer on the network to any other?
Input Specification:
Each i]]></description><category></category></item><item><title><![CDATA[05-树7 堆中的路径 (25分)]]></title><link>https://blog.youkuaiyun.com/LaddC/article/details/107121684</link><guid>https://blog.youkuaiyun.com/LaddC/article/details/107121684</guid><author>LaddC</author><pubDate>Sat, 04 Jul 2020 11:11:41 +0800</pubDate><description><![CDATA[05-树7 堆中的路径 (25分)
将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i，打印从H[i]到根结点的路径。
输入格式:
每组测试第1行包含2个正整数N和M(≤1000)，分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的N个要被插入一个初始为空的小顶堆的整数。最后一行给出M个下标。
输出格式:
对输入中给出的每个下标i，在一行中输出从H[i]到根结点的路径上的数据。数字间以1个空格分隔，行末不得有多余空格。
输入样例:
5 3
46]]></description><category></category></item><item><title><![CDATA[PAT甲级 1064 Complete Binary Search Tree (30分)]]></title><link>https://blog.youkuaiyun.com/LaddC/article/details/107065137</link><guid>https://blog.youkuaiyun.com/LaddC/article/details/107065137</guid><author>LaddC</author><pubDate>Wed, 01 Jul 2020 15:38:50 +0800</pubDate><description><![CDATA[1064 Complete Binary Search Tree (30分)

A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:

The left subtree of a node contains only nodes with keys less than the node's key.
	The right subtree of a node ]]></description><category></category></item></channel></rss>