-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathRange_Sum_Query-Mutable.cpp
74 lines (64 loc) · 2.15 KB
/
Range_Sum_Query-Mutable.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
// segment tree AC :)
class NumArray {
int N;
vector<int> segmentTree;
void build(int node, int left, int right, vector<int> const& data) {
if(left == right) {
segmentTree[node] = data[left];
return;
}
int leftNode = node << 1;
int rightNode = leftNode | 1;
int mid = left + (right - left) / 2;
build(leftNode, left, mid, data);
build(rightNode, mid + 1, right, data);
segmentTree[node] = segmentTree[leftNode] + segmentTree[rightNode];
}
void update(int node, int left, int right, int indx, int val) {
if(indx < left or indx > right) {
return;
}
if(left == right and indx == left) {
segmentTree[node] = val;
return;
}
int leftNode = node << 1;
int rightNode = leftNode | 1;
int mid = left + (right - left) / 2;
update(leftNode, left, mid, indx, val);
update(rightNode, mid + 1, right, indx, val);
segmentTree[node] = segmentTree[leftNode] + segmentTree[rightNode];
}
int query(int node, int left, int right, int x, int y) {
if(x > right or y < left) {
return 0;
}
if(left >= x and right <= y) {
return segmentTree[node];
}
int leftNode = node << 1;
int rightNode = leftNode | 1;
int mid = left + (right - left) / 2;
return (query(leftNode, left, mid, x, y) + query(rightNode, mid + 1, right, x, y));
}
public:
NumArray(vector<int> &nums) {
if(nums.empty()) return;
int length = 2 * pow(2.0, floor(log((double) nums.size() ) / log(2.0)) + 1 );
segmentTree.clear();
segmentTree.resize(length, 0);
N = nums.size();
build(1, 0, N - 1, nums);
}
void update(int i, int val) {
update(1, 0, N - 1, i, val);
}
int sumRange(int i, int j) {
return query(1, 0, N - 1, i, j);
}
};
// Your NumArray object will be instantiated and called as such:
// NumArray numArray(nums);
// numArray.sumRange(0, 1);
// numArray.update(1, 10);
// numArray.sumRange(1, 2);