Advanced Techniques

Back to Topics
Meet in the Middle
Hamming Distance
Corner Subgrid Check
Corner Subgrid Count
Reachable Nodes
Reachability Queries
Cut and Paste
implicit treap
Substring Reversals
implicit treap
Reversals and Sums
implicit treap
Necessary Roads
bridges
Necessary Cities
articulation points
Eulerian Subgraphs
Monster Game I
dp convex hull optimization
Monster Game II
dp convex hull optimization
Subarray Squares
dp convex hull optimization
Houses and Schools
Knuth Division
dp knuth optimization
Apples and Bananas
fft
One Bit Positions
fft
Signal Processing
fft
New Roads Queries
hld
Dynamic Connectivity
dynamic dsu
Parcel Delivery
max flow min cost fixed flow
Task Assignment
max flow min cost
Distinct Routes II
max flow min cost path reconstruction