线段树的发明者:Bentley,我会好好记住他的 = =。
来源:互联网 发布:曲靖市罗平县经济数据 编辑:程序博客网 时间:2024/04/28 12:46
The primary task performed by a segment tree is the same as that done by
an interval tree: keeping track of a set of n intervals, here assumed to be halfopen,
and listing for a given query key all the intervals that contain that key in
output-sensitive time O(log n+ k), if the output consisted of k intervals. It is
slightly worse at this task than the interval tree, having a space requirement of
O(n log n) instead of O(n). But the segment tree, or the idea of the canonical
interval decomposition on which it is based, is really a framework on which
a number of more general tasks can be performed. Again it is a static data
structure. Segment trees were invented by Bentley.
an interval tree: keeping track of a set of n intervals, here assumed to be halfopen,
and listing for a given query key all the intervals that contain that key in
output-sensitive time O(log n+ k), if the output consisted of k intervals. It is
slightly worse at this task than the interval tree, having a space requirement of
O(n log n) instead of O(n). But the segment tree, or the idea of the canonical
interval decomposition on which it is based, is really a framework on which
a number of more general tasks can be performed. Again it is a static data
structure. Segment trees were invented by Bentley.
- 线段树的发明者:Bentley,我会好好记住他的 = =。
- 我会好好的
- 我会好好的
- 我会好好的
- 我希望你会好好的
- 老婆我会好好照顾你的!
- 没有你的路,我依然会好好的走下去!
- 放心吧为了你我也会好好的生活
- 细节,很少关注的细节只有在他给你造成让你能记住的痛苦之后,你才会记住他。
- 我要记住的
- 各种程序设计语言的发明者
- 数据库的发明者
- 在没有你的日子里,我会好好的过的......
- 我的线段树
- 我想领养亲爱的宝贝,好好的爱他
- 我想领养亲爱的宝贝,好好的爱他
- 我想领养亲爱的宝贝,好好的爱他
- 我想领养亲爱的宝贝,好好的爱他
- android学习笔记之--命令集
- 按rule全排列数字筛选(0-1背包)
- 算符优先级 记忆口诀
- PC客户端与Android服务端的Socket同步通信(USB)
- MMS不调用系统函数实现流程
- 线段树的发明者:Bentley,我会好好记住他的 = =。
- 算出某日是这一年的第几天
- 《hadoop 权威指南》 读书笔记
- v4l2初探
- android网络接点
- Win32 API中使用定时器的三种方法
- 一行代码解决IE8浏览器兼容问题
- busybox自带的FTP服务器
- poj 1904【强连通分量】