文件名称:a
-
所属分类:
- 标签属性:
- 上传时间:2014-11-04
-
文件大小:542byte
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
设记录R[i]的关键字为R[i].KEY(1<=i<=k),树结点T[i](1<=i<=K-1)指向败者记录,T[0]为全胜记录下标。写一算法产生对应上述R[i](1<=i<= k)的败者树,要求除R[1..k]和T[0..k-1]以外,只用O(1)辅助空间。-Setting the recording R [i] is a keyword R [i] .KEY (1 < = i < = k), the tree node T [i] (1 < = i < = K-1) points loser record, T [0] is unbeaten record label. Corresponding to the above-described algorithm produces a write R [i] (1 < = i < = k) loser tree requires in addition R [1..k] and T [0..k-1] except using only O (1 ) auxiliary space.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
a.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.