Platinum
The topics below are not exhaustive for this division.
Contest problems may contain topics not covered in the guide, or topics listed under different divisions!
Some lower-frequency topics are included in "Advanced."
Modules Progress
Problems Progress
Range Queries
It seems that no Platinum contest is complete without a segment tree ...
More Applications of Segment Tree
Somewhat Frequent
Walking on a Segment Tree, Non-Commutative Combiner Functions
NaN
Range Queries with Sweep Line
Not Frequent
Solving 2D grid problems using 1D range queries.
NaN
Range Update Range Query
Rare
Lazy updates on segment trees and two binary indexed trees in conjunction.
NaN
Sparse Segment Trees
Rare
Querying big ranges.
NaN
2D Range Queries
Rare
Extending Range Queries to 2D (and beyond).
NaN
Divide & Conquer - SRQ
Rare
Using Divide & Conquer to answer offline or online range queries on a static array.
NaN
Square Root Decomposition
Rare
Splitting up data into smaller chunks to speed up processing.
NaN
Trees
... or a tree!
Binary Jumping
Somewhat Frequent
Introduces the problems of finding level ancestors in a tree and computing the lowest common ancestors.
NaN
Small-To-Large Merging
Rare
A way to merge two sets efficiently.
NaN
Heavy-Light Decomposition
Rare
Path and subtree updates and queries.
NaN
Centroid Decomposition
Rare
Decomposing a tree to facilitate path computations.
NaN
Geometry
More advanced concepts in computational geometry.
Geometry Primitives
Rare
Basic setup for geometry problems.
NaN
Sweep Line
Rare
Introduction to line sweep.
NaN
Convex Hull
Not Frequent
Smallest convex polygon containing a set of points on a grid.
NaN
Convex Hull Trick
Not Frequent
A way to find the maximum or minimum value of several convex functions at given points.
NaN