Ravi shanker prrs
prrs
/ segment_tree.cpp
Created
September 23, 2013 15:43
— forked from Se7soz/segment_tree.cpp
This file contains hidden or 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> |
prrs
/ lazy_segment_tree.cpp
Created
September 23, 2013 15:43
— forked from Se7soz/lazy_segment_tree.cpp
This file contains hidden or 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> |