Range Queries: Square-Root Decomposition, Segment Trees, Binary-Indexed Trees

[[ nSolved ]] / [[ nProblems ]] ([[ percentComplete ]]%) solved by AIEP 2021 Track 1

Problems

1.0 Sqrt Decomposition (Tutorial on CP Algorithms)
1.1 Range Minimum Queries (Slides from Stanford)
2.0 Segment Tree (Tutorial on CP Algorithms)
2.1 Algorithms Dead 3: Segment Trees
2.2 Algorithms Live! Episode 4: Segment Trees
2.3 Algorithm Gym :: Everything About Segment Trees (Codeforces Blog Post)
2.4 Efficient and Easy Segment Trees (Codeforces Blog Post)
3.0 Fenwick Tree (Tutorial on CP Algorithms)
3.1 Algorithms Live! Episode 0: Fenwick Trees
3.2 Binary-Indexed Trees (Tutorial on TopCoder)
3.3 BIT: What is the intuition behind a binary indexed tree and how was it thought about? (CS Stack Exchange)
Efficient Range Minimum Queries using Binary Indexed Trees (IOI Conference 2015)
Find the largest sum subarray from the given array using segment trees (Stack Overflow)
Range Minimum Query (Tutorial on CP Algorithms)

Network Error! Latest rankings cannot be retrieved.

Rank	Username	Solved	[[ problem.number ]] [[ problem.name ]]
[[ user.rank ]]	[[ user.username ]]	[[ user.nSolved ]]