[deprecated] misc/odt #1179
giscus[bot]
bot
Replies: 5 comments 6 replies
-
|
线段树那边基本没什么习题，倒是这边留了一堆线段树的题，可还行（ |
Beta Was this translation helpful? Give feedback.
-
|
odt.insert(Node_t(l, x - 1, v));这个当l=x时会增加无用节点吧，建议加个特判 |
Beta Was this translation helpful? Give feedback.
-
|
|
Beta Was this translation helpful? Give feedback.
-
|
前面那个是小于等于后面哪个是大于等于 |
Beta Was this translation helpful? Give feedback.
-
|
不对,一个是 大于,一个是大于等于 |
Beta Was this translation helpful? Give feedback.
-
|
哦,我搞错了,前面的是最后一个 小于等于,后面的是 第一个 大于等于 |
Beta Was this translation helpful? Give feedback.
-
|
模版 是否 有误?? |
Beta Was this translation helpful? Give feedback.
-
|
哦哦哦 ,没事,我搞错了 |
Beta Was this translation helpful? Give feedback.
-
|
复杂度 loglog 很不对吧 |
Beta Was this translation helpful? Give feedback.
-
|
好像是随机情况下 set 里的元素个数是 logn，然后在 set 里按 rank 查询是 log 的，所以是 loglog（小声 |
Beta Was this translation helpful? Give feedback.
-
|
我把双 log 理解成 log(log) 了（） |
Beta Was this translation helpful? Give feedback.
-
珂朵莉树/颜色段均摊
OI Wiki 是一个编程竞赛知识整合站点，提供有趣又实用的编程竞赛知识以及其他有帮助的内容，帮助广大编程竞赛爱好者更快更深入地学习编程竞赛
https://oi-wiki.org/misc/odt/
Beta Was this translation helpful? Give feedback.
All reactions