-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSegTree.java
More file actions
242 lines (211 loc) · 6.22 KB
/
Copy pathSegTree.java
File metadata and controls
242 lines (211 loc) · 6.22 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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
import java.util.*;
import java.io.*;
import java.math.*;
import java.text.*;
public class SegTree {
static PrintWriter out;
static Reader in;
static int nodes;
public static void main(String[] args) throws IOException {
initInputOutput();
SegTree solver = new SegTree();
solver.solve();
out.close();
out.flush();
}
void solve() throws IOException {
nodes = in.nextInt();
int[] arr = new int[nodes];
for (int i = 0; i < nodes; i++) arr[i] = in.nextInt();
SegTree st = new SegTree(0, nodes - 1, arr);
}
static class SegTree {
int leftmost, rightmost;
SegTree lChild, rChild;
long value;
long toProp;
public SegTree(int leftmost, int rightmost, int[] a) {
this.leftmost = leftmost;
this.rightmost = rightmost;
if (leftmost != rightmost) {
int mid = (leftmost + rightmost) / 2;
lChild = new SegTree(leftmost, mid, a);
rChild = new SegTree(mid + 1, rightmost, a);
recalc();
} else init_leaf(a[leftmost]);
}
public void init_leaf(int val) {
value = val;
}
public void recalc() {
value = Math.min(lChild.value, rChild.value);
}
public void prop() {
if (toProp == 0) {
return;
}
value += toProp;
if (leftmost != rightmost) {
lChild.toProp += toProp;
rChild.toProp += toProp;
}
toProp = 0;
}
public void pointUpdate(int position, int newValue) {
if (leftmost == rightmost) {
value = newValue;
return;
}
if (position <= lChild.rightmost) {
lChild.pointUpdate(position, newValue);
} else {
rChild.pointUpdate(position, newValue);
}
recalc();
}
public void update(int l, int r, int v) {
if (l <= leftmost && rightmost <= r) {
toProp += v;
prop();
return;
}
prop();
if (l > rightmost || r < leftmost) {
return;
}
lChild.update(l, r, v);
rChild.update(l, r, v);
recalc();
}
public long query(int l, int r) {
prop();
if (l <= leftmost && rightmost <= r) {
return value;
}
if (l > rightmost || r < leftmost) {
return INF;
}
return Math.min(lChild.query(l, r), rChild.query(l, r));
}
}
static class Reader {
private InputStream mIs;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
public Reader() {
this(System.in);
}
public Reader(InputStream is) {
mIs = is;
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = mIs.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public String nextLine() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isEndOfLine(c));
return res.toString();
}
public String next() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
double nextDouble() {
return Double.parseDouble(next());
}
public long nextLong() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public boolean isEndOfLine(int c) {
return c == '\n' || c == '\r' || c == -1;
}
}
static void initInputOutput() throws IOException {
// input
File f = new File("in.txt");
if (f.exists() && !f.isDirectory()) {
in = new Reader(new FileInputStream("in.txt"));
} else {
in = new Reader();
}
// output
f = new File("out.txt");
if (f.exists() && !f.isDirectory()) {
out = new PrintWriter(new File("out.txt"));
} else {
out = new PrintWriter(System.out);
}
}
}