Data Structures -> Segment Tree Beats
Richer segment-tree summaries for online range chmin / chmax / add / sum when ordinary lazy tags stop closing cleanly.
- Topic slug:
data-structures/segment-tree-beats
- Tutorial page: Open tutorial
- Ladder page: Open ladder
- Repo problems currently tagged here:
1
- Repo companion pages:
5
- Curated external problems:
2
Microtopics
- range-chmin
- range-chmax
- second-maximum
- second-minimum
- beats-pruning
- amortized-pushdown
Learning Sources
Practice Sources
Repo Companion Material
Curated External Problems
Core
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| Range Chmin Chmax Add Range Sum |
Library Checker |
Hard |
Range Queries |
Data-Structure-Heavy; Verification |
Lazy Segment Tree; Second Extremum Summaries; Amortized Pushdown |
Range-Chmin; Range-Chmax; Range-Add |
The cleanest official verifier for the exact canonical beats starter shipped in this repo. |
Bridge
| Problem |
Source |
Difficulty |
Context |
Style |
Prerequisites |
Tags |
Why it fits |
| The Child and Sequence |
Codeforces |
Hard |
Compare Point |
Data-Structure-Heavy; Compare-Point |
Segment Tree; Current Maximum Pruning; Amortized Reasoning |
Beats-Like-Pruning; Range-Modulo; Range-Sum |
The classic compare point where the same pruning mindset appears, but the exact canonical chmin/chmax/add/sum starter does not apply directly. |
Repo Problems
| Code |
Title |
Fit |
Difficulty |
Pattern |
Note |
Solution |
RANGECHMINCHMAXADDRANGESUM |
Range Chmin Chmax Add Range Sum |
primary |
hard |
segment tree beats; range chmin; range chmax; second extremum summaries |
Note |
Code |
Regeneration
python3 scripts/generate_problem_catalog.py