Implicit Segment Trees - Advanced Data Structures · LearnToCP

LearnToCP

Implicit Segment Trees

Navigation

Home Roadmap Problems About Us

Theory

Contest Knowledge

Selecting an IDE Interactive Tasks Output-Only Tasks

Basics

Your First Program Data types and IO C++ syntax Modulo Functions Vectors Matrices Time Complexity

Sorting

Sorting Counting sort Radix Sort

Optimization Techniques

Two Pointers Sum of numbers 1 to n Prefix sum Binary Search Greedy Binary Search Functions Binary Search by Answer Divide and Conquer

Binary Numbers

Binary Numbers Numbers in code Bitwise Operations Bitmasks

Math

Binary Exponentiation Prime Numbers Prime Factorization GCD and LCM Sieve of Eratosthenes Modified Sieve

Data Structures

Strings Stack Queue Maps Sets Priority Queue Custom Criteria for Functions Segment Trees Fenwick Trees Sparse Tables Union Find Sqrt Decomposition

Combinatorics

Addition Rule Multiplication Rule Combinatoric Objects Inclusion Exclusion Principle

Geometry

Geometry Basics Cross and Dot Product Lines Polygons Points and Polygons Convex Hull

Recursion

Pointers Recursion Generating Combinatoric Objects

Dynamic Programming

About DP DP problems Tree DP Bitmask DP

Graph Theory

Graphs DFS and BFS Shortest Paths Trees Topological Sorting Dijkstra's Algorithm Minimum Spanning Trees Shortest Path Algorithms

Advanced Graph Theory

Biconnectivity Strongly Connected Components Bipartite Graph Graph Flow Augmenting Paths Flow - Minimum Cut Duality Heavy-Light Decomposition Centroid Decomposition

Advanced Data Structures

2D and 3D Segment Trees Lazy Propagation Implicit Segment Trees Persistent Segment Trees Lowest Common Ancestor Trie Balanced Binary Search Trees Mo's Algorithm