PrevNext
Rare
 0/10

Range Update Range Query

Author: Benjamin Qi

Lazy updates on segment trees and two binary indexed trees in conjunction.

BIT Revisited

Focus Problem – read through this problem before continuing!

Binary Indexed Trees can support range increments in addition to range sum queries.

Implementation

Resources
Benq

This section is not complete.

Feel free to file a request to complete this using the "Contact Us" button.

Problems

StatusSourceProblem NameDifficultyTagsSolution
CSESEasy
Show Tags

BIT-Range

Show Sketch

Lazy Segment Tree

Focus Problem – read through this problem before continuing!

Tutorial

Resources
CPHshort description
CSAinteractive
cp-algoadding on segments, assigning
CFcode is more confusing than recursive version

Implementation

This section is not complete.

Feel free to file a request to complete this using the "Contact Us" button.

Problems

StatusSourceProblem NameDifficultyTagsSolution
YSEasy
Show Tags

Lazy SegTree

View Solution
PlatEasy
Show Tags

Lazy SegTree

External Sol
Old GoldEasy
Show Tags

Lazy SegTree

External Sol
IOINormalExternal Sol
PlatNormal
Show Tags

Lazy SegTree

External Sol
JOIVery Hard
Show Tags

Lazy SegTree

External Sol
DMOJVery Hard
Show Tags

Lazy SegTree

Check DMOJ

Module Progress:

Give Us Feedback on Range Update Range Query!

PrevNext