bitsetword-parallelismtransitive-closureconstant-factormos-algorithmoffline-queriessqrt-decompositionblock-sizestructure-choicenon-decomposable-aggregatecomplexity-tuningcdq-divide-and-conquerpartial-orderthree-dimensional-dominancedsu-on-treesmall-to-largeheavy-lightamortized-analysisrollback-moirreversible-operationssegment-tree-beatschmin-chmaxsecond-maximumpotential-functionrange-addkinetic-segment-treemonotone-timeconvex-hull-trick+1+2+3+4

Learning Resources

OI Wiki, Mo's algorithm and its variants

OI Wiki, Segment Tree Beats

OI Wiki, Sqrt decomposition (blocking)

OI Wiki, CDQ divide and conquer

OI Wiki, DSU on tree

Eric Zhang, kinetic tournament (kinetic segment tree) reference implementation

OI Wiki, std::bitset in competitive programming

Up next

10 of 10 questions here are still unsolved.

Next module DP Optimization Black Magic