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
Updated: Last week
Range Queries with Sweep Line
Not Frequent
Solving 2D grid problems using 1D range queries.
Updated: 6 days ago
Range Update Range Query
Rare
Lazy updates on segment trees and two binary indexed trees in conjunction.
Updated: Last week
Sparse Segment Trees
Rare
Querying big ranges.
2D Range Queries
Rare
Extending Range Queries to 2D (and beyond).
Divide & Conquer - SRQ
Rare
Using Divide & Conquer to answer offline or online range queries on a static array.
Updated: Last week
Square Root Decomposition
Rare
Splitting up data into smaller chunks to speed up processing.
Updated: Last week
Trees
... or a tree!
Binary Jumping
Somewhat Frequent
Introduces the problems of finding level ancestors in a tree and computing the lowest common ancestors.
Updated: Last week
Small-To-Large Merging
Rare
A way to merge two sets efficiently.
Updated: Last week
Heavy-Light Decomposition
Rare
Path and subtree updates and queries.
Updated: Last week
Centroid Decomposition
Rare
Decomposing a tree to faciliate path computations.
Updated: 6 days ago
Convex Hull
Most Platinum geometry problems.
Geometry Primitives
Rare
Basic setup for geometry problems.
Sweep Line
Rare
Introduction to line sweep.
Updated: 6 days ago
Convex Hull
Not Frequent
Smallest convex polygon containing a set of points on a grid.
Convex Hull Trick
Not Frequent
A way to find the maximum or minimum value of several convex functions at given points.
Updated: Last week
Dynamic Programming
Dynamic Programming on Bitmasks
Not Frequent
DP problems that require iterating over subsets.
Updated: 6 days ago
Dynamic Programming on Ranges
Not Frequent
Solving the problem on every contiguous subarray of the original array.
Divide & Conquer - DP
Rare
Using Divide & Conquer as a DP Optimization.
Updated: 6 days ago