- 博客(5)
- 收藏
- 关注
RSS订阅原创 06-图2 Saving James Bond - Easy Version (25分)
06-图2 Saving James Bond - Easy Version (25分)This time let us consider the situation in the movie "Live and Let Die" in which James Bond, the world's most famous spy, was captured by a group
2016-04-17 11:24:22
1078
原创 06-图1 列出连通集 (25分)
06-图1 列出连通集 (25分)给定一个有NN个顶点和EE条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N1N−1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。输入格式:输入第1行给出2个整数NN(0N100N≤10)和EE，分别是图的顶点数和边数。随后EE行，每行给出一条边的两个端点。每行中的数字之间
2016-04-17 11:16:08
1324
原创 05-树9 Huffman Codes (30分)
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 scie
2016-04-02 15:27:36
4579
原创 05-树8 File Transfer (25分)
05-树8 File Transfer (25分)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 possibl
2016-04-02 15:16:51
3417
原创 05-树7 堆中的路径 (25分)
05-树7 堆中的路径 (25分)将一系列给定数字插入一个初始为空的小顶堆H[]。随后对任意给定的下标i，打印从H[i]到根结点的路径。输入格式:每组测试第1行包含2个正整数NN和MM(1000≤1000)，分别是插入元素的个数、以及需要打印的路径条数。下一行给出区间[-10000, 10000]内的NN个要被插入一个初始为空的小顶堆的整数。最后一行给出MM
2016-04-02 15:06:59
2553
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人