![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
平衡树纲
文章平均质量分 88
Friedrich_Taylor
Weeping may remain for a night,but joy comes in the morning
展开
-
无旋Treap——从入门到放弃
前言已经是从入门到放弃的第四篇了。 但是本文并不打算给大家讲无旋Treap复杂度证明一类的。 很显然每次操作都是期望Olog(n)的{\bf O}\log(n)的什么是Treap?Treap=Tree+heap 其核心思想在于在权值上维护一棵二叉查找树,在优先级上维护一个堆 有旋treap利用旋转操作来维护堆的性质, 而无旋treap利用有序构树维护堆的性质。无旋Treap的两大构树顺序:原创 2017-09-22 15:53:27 · 5115 阅读 · 1 评论 -
11.6考试爆炸记
boom… 100→50 (1)blash 队列操作题,自带双指针#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<ctime>#include<cmath>#include<algorithm>#include<cctype>#includ原创 2017-11-06 20:54:05 · 380 阅读 · 0 评论 -
11.7考试爆炸记
boom… 100→30 晚景凄凉 (1)sum ksc#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<string>#include<ctime>#include<cmath>#include<algorithm>#include<cctype>#include<io原创 2017-11-07 19:11:44 · 518 阅读 · 0 评论