Lecture 1: Introduction to Research — [📝Lecture Notebooks] [
Lecture 2: Introduction to Python — [📝Lecture Notebooks] [
Lecture 3: Introduction to NumPy — [📝Lecture Notebooks] [
Lecture 4: Introduction to pandas — [📝Lecture Notebooks] [
Lecture 5: Plotting Data — [📝Lecture Notebooks] [[
Se7soz
/ lazy_segment_tree.cpp
Last active
May 9, 2024 18:35
An example for lazy segment trees.. to read full topic visit http://se7so.blogspot.com
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * In this code we have a very large array called arr, and very large set of operations | |
| * Operation #1: Increment the elements within range [i, j] with value val | |
| * Operation #2: Get max element within range [i, j] | |
| * Build tree: build_tree(1, 0, N-1) | |
| * Update tree: update_tree(1, 0, N-1, i, j, value) | |
| * Query tree: query_tree(1, 0, N-1, i, j) | |
| */ | |
| #include<iostream> |