竞争性程序设计：竞争性程序设计的数据结构和算法-源码

[{"title":"（70个子文件45KB）竞争性程序设计：竞争性程序设计的数据结构和算法-源码","children":[{"title":"competitive-programming-master","children":[{"title":"graph","children":[{"title":"hld.cpp <span style='color:#111;'>1.24KB</span>","children":null,"spread":false},{"title":"boruvka.cpp <span style='color:#111;'>1.80KB</span>","children":null,"spread":false},{"title":"bruijn.cpp <span style='color:#111;'>580B</span>","children":null,"spread":false},{"title":"eulerian_path.cpp <span style='color:#111;'>1.03KB</span>","children":null,"spread":false},{"title":"centroid_decomp.cpp <span style='color:#111;'>909B</span>","children":null,"spread":false},{"title":"dijkstra.cpp <span style='color:#111;'>1.05KB</span>","children":null,"spread":false},{"title":"lca_binary_lifting.cpp <span style='color:#111;'>1.35KB</span>","children":null,"spread":false},{"title":"edmonds_karp.cpp <span style='color:#111;'>1.48KB</span>","children":null,"spread":false},{"title":"2-sat.cpp <span style='color:#111;'>1.67KB</span>","children":null,"spread":false},{"title":"floyd.cpp <span style='color:#111;'>692B</span>","children":null,"spread":false},{"title":"bellmanford.cpp <span style='color:#111;'>860B</span>","children":null,"spread":false},{"title":"kosaraju.cpp <span style='color:#111;'>1005B</span>","children":null,"spread":false},{"title":"kruskal.cpp <span style='color:#111;'>1.08KB</span>","children":null,"spread":false},{"title":"topological_sort.cpp <span style='color:#111;'>814B</span>","children":null,"spread":false},{"title":"dinic.cpp <span style='color:#111;'>1.98KB</span>","children":null,"spread":false}],"spread":false},{"title":"others","children":[{"title":"alg1.cpp <span style='color:#111;'>702B</span>","children":null,"spread":false},{"title":"ancestor.cpp <span style='color:#111;'>1.02KB</span>","children":null,"spread":false},{"title":"mo.cpp <span style='color:#111;'>1.16KB</span>","children":null,"spread":false}],"spread":true},{"title":"LICENSE <span style='color:#111;'>1.05KB</span>","children":null,"spread":false},{"title":"math","children":[{"title":"linear_divisors0.cpp <span style='color:#111;'>904B</span>","children":null,"spread":false},{"title":"primitive_root.cpp <span style='color:#111;'>849B</span>","children":null,"spread":false},{"title":"segmented_sieve.cpp <span style='color:#111;'>1012B</span>","children":null,"spread":false},{"title":"pollard_rho_128bit.cpp <span style='color:#111;'>3.01KB</span>","children":null,"spread":false},{"title":"linear_phi.cpp <span style='color:#111;'>568B</span>","children":null,"spread":false},{"title":"discrete_log.cpp <span style='color:#111;'>664B</span>","children":null,"spread":false},{"title":"linear_sieve.cpp <span style='color:#111;'>420B</span>","children":null,"spread":false},{"title":"ternary_search.cpp <span style='color:#111;'>944B</span>","children":null,"spread":false},{"title":"matrix_expo.cpp <span style='color:#111;'>1.08KB</span>","children":null,"spread":false},{"title":"phi.cpp <span style='color:#111;'>339B</span>","children":null,"spread":false},{"title":"rabin_miller.cpp <span style='color:#111;'>1.04KB</span>","children":null,"spread":false},{"title":"discrete_root.cpp <span style='color:#111;'>1.91KB</span>","children":null,"spread":false},{"title":"ext_gcd.cpp <span style='color:#111;'>467B</span>","children":null,"spread":false},{"title":"pollard_rho.cpp <span style='color:#111;'>2.11KB</span>","children":null,"spread":false},{"title":"lpf.cpp <span style='color:#111;'>661B</span>","children":null,"spread":false},{"title":"linear_divisors1.cpp <span style='color:#111;'>862B</span>","children":null,"spread":false},{"title":"modmul_64bit.cpp <span style='color:#111;'>576B</span>","children":null,"spread":false},{"title":"nCk_lucas.cpp <span style='color:#111;'>1.25KB</span>","children":null,"spread":false}],"spread":false},{"title":".gitignore <span style='color:#111;'>12B</span>","children":null,"spread":false},{"title":"dp","children":[{"title":"lis_nlog2.cpp <span style='color:#111;'>340B</span>","children":null,"spread":false},{"title":"lcs.cpp <span style='color:#111;'>474B</span>","children":null,"spread":false},{"title":"tsp.cpp <span style='color:#111;'>875B</span>","children":null,"spread":false},{"title":"lis.cpp <span style='color:#111;'>422B</span>","children":null,"spread":false},{"title":"lps.cpp <span style='color:#111;'>573B</span>","children":null,"spread":false},{"title":"lis_nlog.cpp <span style='color:#111;'>762B</span>","children":null,"spread":false}],"spread":true},{"title":"string","children":[{"title":"duval.cpp <span style='color:#111;'>745B</span>","children":null,"spread":false},{"title":"prefix_function.cpp <span style='color:#111;'>456B</span>","children":null,"spread":false},{"title":"z.cpp <span style='color:#111;'>540B</span>","children":null,"spread":false},{"title":"kmp.cpp <span style='color:#111;'>839B</span>","children":null,"spread":false},{"title":"prefix_automaton.cpp <span style='color:#111;'>1005B</span>","children":null,"spread":false},{"title":"suffix_array.cpp <span style='color:#111;'>1.38KB</span>","children":null,"spread":false},{"title":"hashing2d.cpp <span style='color:#111;'>1.84KB</span>","children":null,"spread":false},{"title":"hashing.cpp <span style='color:#111;'>1.77KB</span>","children":null,"spread":false},{"title":"trie.cpp <span style='color:#111;'>1.22KB</span>","children":null,"spread":false},{"title":"lp_substring.cpp <span style='color:#111;'>878B</span>","children":null,"spread":false},{"title":"rabin_karp.cpp <span style='color:#111;'>971B</span>","children":null,"spread":false}],"spread":false},{"title":"README.md <span style='color:#111;'>3.89KB</span>","children":null,"spread":false},{"title":"data_structure","children":[{"title":"segtree_lazy.cpp <span style='color:#111;'>1.30KB</span>","children":null,"spread":false},{"title":"bit.cpp <span style='color:#111;'>413B</span>","children":null,"spread":false},{"title":"ordered_set.cpp <span style='color:#111;'>500B</span>","children":null,"spread":false},{"title":"merge_sort_tree.cpp <span style='color:#111;'>969B</span>","children":null,"spread":false},{"title":"dsu.cpp <span style='color:#111;'>468B</span>","children":null,"spread":false},{"title":"treap.cpp <span style='color:#111;'>4.41KB</span>","children":null,"spread":false},{"title":"in <span style='color:#111;'>18B</span>","children":null,"spread":false},{"title":"min_queue.cpp <span style='color:#111;'>1.23KB</span>","children":null,"spread":false},{"title":"sparse_table.cpp <span style='color:#111;'>683B</span>","children":null,"spread":false},{"title":"segtree.cpp <span style='color:#111;'>943B</span>","children":null,"spread":false},{"title":"bit2D.cpp <span style='color:#111;'>754B</span>","children":null,"spread":false},{"title":"persistent_segtree.cpp <span style='color:#111;'>1.39KB</span>","children":null,"spread":false},{"title":"implicit_treap.cpp <span style='color:#111;'>4.41KB</span>","children":null,"spread":false},{"title":"dsu_rollback.cpp <span style='color:#111;'>1.11KB</span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]