-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathSegmentTree.cpp
More file actions
140 lines (110 loc) · 3.24 KB
/
SegmentTree.cpp
File metadata and controls
140 lines (110 loc) · 3.24 KB
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <bits/stdc++.h> // all c++ libraries
// defines
#define faster_io ios_base::sync_with_stdio(false);cin.tie()
#define range(i,a,b) for(int i=a;i<=b;i++)
#define rrange(i,a,b) for(int i=a;i>=b;i--)
#define rangev(i,a) for(int i=0;i<a.size();i++)
#define rrangev(i,a) for(int i=a.size()-1;i>=0;i--)
#define rangem(x,v) for(typeof (v).begin() x=(v).begin();x!=(v).end();++x)
#define clr(a) memset(a, 0, sizeof(a))
#define all(a) a.begin(), a.end()
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define MX 300005
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int, int> pii;
typedef vector <pii> vii;
typedef pair<double, int> pdi;
typedef vector<pdi> vdi;
const ll INF = 1e9 + 100;
const ll MOD = 1e9 + 7;
class Tree {
public:
int *arr, *temp;
int len;
Tree() {};
Tree(int inp_len, int *inp_arr);
void create();
void update(int ll, int rr, int val);
int getMin(int ll, int rr);
private:
void create(int left, int right, int index);
void update(int ll, int rr, int val, int left, int right, int index);
int getMin(int ll, int rr, int left, int right, int index);
};
Tree::Tree(int inp_len, int *inp_arr) {
arr = new int[inp_len];
range(i, 1, inp_len) {
arr[i] = inp_arr[i];
}
temp = new int[4 * inp_len];
len = inp_len;
}
void Tree::create() {
create(1, len, 1);
}
void Tree::create(int left, int right, int index) {
if(left == right) {
temp[index] = arr[left];
return;
}
int mid = (left + right) / 2;
create(left, mid, index * 2);
create(mid + 1, right, index * 2 + 1);
temp[index] = min(temp[index * 2], temp[index * 2 + 1]);
}
int Tree::getMin(int ll, int rr) {
return getMin(ll, rr, 1, len, 1);
}
void Tree::update(int ll, int rr, int val) {
update(ll, rr, val, 1, len, 1);
}
void Tree::update(int ll, int rr, int val, int left, int right, int index) {
if(ll > len || ll > rr || rr < 0) {
cerr << "INVALID INPUT\n";
return;
}
if(left > rr || right < ll) {
return;
}
if(left >= ll && right <= rr) {
temp[index] += val;
return;
}
int mid = (left + right) / 2;
update(ll, rr, val, left, mid, index * 2);
update(ll, rr, val, mid + 1, right, index * 2 + 1);
temp[index] = min(temp[index * 2], temp[index * 2 + 1]);
return;
}
int Tree::getMin(int ll, int rr, int left, int right, int index) {
if(ll > len || ll > rr || rr < 0) {
cerr << "INVALID INPUT\n";
return -1;
}
if(left >= ll && right <= rr && left == right) {
return temp[index];
}
if(left > rr || right < ll) {
return INT_MAX;
}
int mid = (left + right) / 2;
int t1 = getMin(ll, rr, left, mid, index * 2);
int t2 = getMin(ll, rr, mid + 1, right, index * 2 + 1);
return min(t1, t2);
}
int main() {
faster_io;
int arr[10] = {0, 7, 3, 5, 1, 9, 4, 8, -2, 1};
int N = sizeof(arr) / sizeof(arr[0]);
Tree *tree = new Tree(N, arr);
tree->create();
cout << tree->getMin(3, 8) << "\n";
tree->update(8, 9, 6);
cout << tree->getMin(4, 8) << "\n";
return 0;
}