上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 31 下一页
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.lydsy.co 阅读全文
posted @ 2018-11-23 10:39 AKMer 阅读(143) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "http://poj.org/probl 阅读全文
posted @ 2018-11-22 12:06 AKMer 阅读(153) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.lydsy.co 阅读全文
posted @ 2018-11-21 20:34 AKMer 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.luogu.or 阅读全文
posted @ 2018-11-21 15:09 AKMer 阅读(222) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.lydsy.co 阅读全文
posted @ 2018-11-21 10:16 AKMer 阅读(200) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.lydsy.co 阅读全文
posted @ 2018-11-20 21:31 AKMer 阅读(148) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.lydsy.co 阅读全文
posted @ 2018-11-20 17:18 AKMer 阅读(230) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.lydsy.co 阅读全文
posted @ 2018-11-20 09:33 AKMer 阅读(184) 评论(0) 推荐(0) 编辑
摘要: 浅谈$splay$: "https://www.cnblogs.com/AKMer/p/9979592.html" 浅谈$fhq$_$treap$: "https://www.cnblogs.com/AKMer/p/9981274.html" 题目传送门: "https://www.lydsy.co 阅读全文
posted @ 2018-11-19 20:15 AKMer 阅读(273) 评论(0) 推荐(0) 编辑
摘要: $BST$ 二叉查找树,首先它是一颗二叉树,其次它里面每个点都满足以该点左儿子为根的子树里结点的值都小于自己的值,以该点右儿子为根的子树里结点的值都大于自己的值。如果不进行修改,每次查询都是$O(logn)$的。 $fhq$_$treap$ 一种支持分离与合并的二叉查找树,由于合并使用了随机函数,所 阅读全文
posted @ 2018-11-19 08:33 AKMer 阅读(462) 评论(0) 推荐(0) 编辑
上一页 1 ··· 15 16 17 18 19 20 21 22 23 ··· 31 下一页