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 the name of Allah. | |
| // We're nothing and you're everything. | |
| // Ya Ali! | |
| #include <bits/stdc++.h> | |
| using namespace std; | |
| typedef long long ll; | |
| const int maxn = 1e2 + 14, lg = 15; |
shobhit6993
/ segmentTree_lazy_min.cpp
Last active
June 6, 2023 21:24
— forked from Se7soz/lazy_segment_tree.cpp
C++ implementation of segment tree with lazy propagation.
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) | |
| * Actual space required by the tree = 2*2^ceil(log_2(n)) - 1 | |
| */ |