Hotman's Library

util/ACL.hpp math/test/AOJ_binary_search.test.cpp segment_tree/test/AOJ_dual_segment_tree.test.cpp math/test/AOJ_is_prime.test.cpp segment_tree/test/AOJ_lazy_segment_tree.test.cpp math/test/AOJ_prime_factor.test.cpp math/test/AOJ_prime_list.test.cpp Aho-Corasick法形式的冪級数(BASE)形式的冪級数(Integer)形式的冪級数(ModInt)data_structure/HLD_lazy.hpp data_structure/HLD_seg.hpp util/test/LC_Number_of_Substrings.test.cpp data_structure/test/LC_RMQ.test.cpp util/test/LC_Suffix_Array.test.cpp string/test/LC_Z_algorizm.test.cpp data_structure/test/LC_binary_indexed_tree.test.cpp data_structure/test/LC_binary_trie.test.cpp data_structure/test/LC_birary_heap.test.cpp data_structure/test/LC_cartesian_tree.test.cpp graph_tree/test/LC_centroid_decomposition.test.cpp math/test/LC_convolution_1000000007.test.cpp math/test/LC_convolution_998244353.test.cpp graph_tree/test/LC_dijkstra.test.cpp graph_tree/test/LC_dijkstra_fast.test.cpp graph_tree/test/LC_dinic.test.cpp data_structure/test/LC_disjoint_sparse_table.test.cpp graph_tree/test/LC_dominator_tree.test.cpp data_structure/test/LC_fast_set.test.cpp math/test/LC_floor_sum.test.cpp data_structure/test/LC_hash_map.test.cpp math/test/LC_interpolation.test.cpp graph_tree/test/LC_lca.test.cpp graph_tree/test/LC_lca_short.test.cpp data_structure/test/LC_line_add_get_min.test.cpp graph_tree/test/LC_maximum_independent_set.test.cpp graph_tree/test/LC_min_cost_flow.test.cpp math/test/LC_mod_log.test.cpp math/test/LC_mod_sqrt.test.cpp string/test/LC_online_Z_algorizm.test.cpp math/test/LC_prime_factor.test.cpp graph_tree/test/LC_push_relabel.test.cpp data_structure/test/LC_segment_add_get_min.test.cpp segment_tree/test/LC_segment_tree.test.cpp data_structure/test/LC_sparse_table.test.cpp math/test/LC_sum_power_poly_limit.cpp data_structure/test/LC_swag.test.cpp math/test/LC_tetration.test.cpp math/test/LC_totient_sum.test.cpp data_structure/test/LC_wavelet_matrix.test.cpp 最大値最小値 math/NTT2d.hpp RMQ&lt;O(N),O(1)&gt;dsu/UF_data.hpp dsu/UF_list.hpp string/test/YUKI_Aho_Corasick.test.cpp Zアルゴリズム math/and_convolution.hpp RangeArgminQuery &lt;O(N),O(1)&gt;最大値とその位置最小値とその位置 BBST/AVL/base.hpp BBST/RBST/base.hpp ベルマンフォード法(WIP)BinaryHeap BinaryIndexedTree 二分探索二分探索(double)BinaryTrie BitVector カーマイケル関数 cartesian_tree カタラン台形 math/ceil_pow2.hpp 重心分解重心分解部分木の大きさ data_structure/cht.hpp 二項係数 mod P 一次関数の合成 math/concave_max_plus_convolution.hpp util/cpp_int.hpp 累積和(WIP)根からの深さダイクストラ法 O((E+V)logE)ダイクストラ O(E+VlogE)最大流(Dinic法)DisjointSparseTable graph_tree/distance.hpp 約数列挙支配木双対セグメント木オイラーのファイ関数 graph_tree/euler_tour.hpp data_structure/euler_tour_tree.hpp math/fact_list.hpp 素因数分解(高速)高速入出力(WIP)FastSet(遅い)多項式乗算 \sum_{i=0}^{n-1}\floor(a*i+b/c)形式的冪級数ガーナーのアルゴリズム math/get_monomials.hpp グラフテンプレート HashMap util/int128.hpp 素数判定(高速)素数判定(高速)Kd木(WIP)math/kth_root.hpp ラグランジュ補完(連続点->一点)segment_tree/lazy_segment_tree.hpp give_us_tmp/lca.cpp LCA &lt;O(N),O(1)&gt;(HL分解と同等の速さ)LCA(HL分解)&lt;O(N),O(logN)&gt;マージ可能ヒープ(LeftistHeap)graph_tree/lex_bfs.hpp LiChaoTree data_structure/link_cut_tree.hpp util/make_case.hpp Manacher 最大独立集合(V<=50)Maybe 最小費用流(CostScaling)うしさんからパクってきた最小費用流 give_us_tmp/mod_int.cpp ModInt ModInt(1'000'000'007)ModInt(998'244'353)ModInt math/mod_inv.hpp 離散対数(ModLog)(x^y)%mod ModSqrt alga/monoid.hpp DP/monotone_minima.hpp data_structure/my_deque.hpp オンラインZアルゴリズム math/or_convolution.hpp osa_k法 math/partition_function.hpp util/pbds.hpp 素因数分解(高速)素数列挙最大流(push_relabel法O(V^2√E))util/random_gen.hpp 区間加算全方位木DP ローリングハッシュ強連結成分分解セグメント木 BBST/AVL/set.hpp 最短経路木 O((E+V)logE)マージ可能ヒープ(SkewHeap)data_structure/slide_max.hpp data_structure/slide_min.hpp data_structure/small_rmq.hpp SparseTable BBST/splay_tree/splay_tree_array.hpp BBST/splay_tree/splay_tree_array_ushi.hpp BBST/splay_tree/splay_tree_base.hpp BBST/splay_tree/splay_tree_map_ushi.hpp BBST/splay_tree/splay_tree_set.hpp 平方分割(WIP)math/stern_brocot_tree.cpp 部分列DP(WIP)SuffixArray SuffixAutomaton math/sum_power_poly.hpp math/sum_power_poly_limit.hpp SWAG(Queue)util/template.hpp テトレーション TopTree(WIP)トポロジカルソートトーシェント関数の和木上の畳み込み(WIP)Trie木 Trie(WIP)二辺連結成分分解 2-SAT 根とのPathの中での最小値を返すUnionFind Union Find dsu/test/union_find.test.cpp 更新 WaveletMatrix(WIP)data_structure/x_fast_trie.hpp math/xor_convolution.hpp

BBST/RBST/base.hpp

View this file on GitHub
Last update: 2020-09-17 09:30:53+09:00
Include: #include "BBST/RBST/base.hpp"

Code

#line 1 "BBST/RBST/base.hpp"

Back to top page

hotman

This documentation is automatically generated by online-judge-tools/verification-helper
This documentation theme is forked by ei1333/minima