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
pub mod range_add_segment_tree {
use std::cmp;
pub const NUM: usize = 1 << 20;
pub const INF: i64 = 1 << 60;
pub struct RangeAddSegmentTree {
seg_min: Vec<i64>,
seg_max: Vec<i64>,
seg_add: Vec<i64>,
}
impl RangeAddSegmentTree {
pub fn new() -> Self {
RangeAddSegmentTree {
seg_min: vec![INF; NUM * 2],
seg_max: vec![-INF; NUM * 2],
seg_add: vec![0; NUM * 2],
}
}
pub fn add(&mut self, a: usize, b: usize, value: i64) {
self.add_to_range(a, b, value, 0, 0, NUM);
}
fn add_to_range(
&mut self,
a: usize,
b: usize,
value: i64,
k: usize,
left: usize,
right: usize,
) {
if b <= left || right <= a {
return;
}
if a <= left && right <= b {
let mut k = k;
self.seg_add[k] += value;
while k > 0 {
k = (k - 1) / 2;
self.seg_min[k] = cmp::min(
self.seg_min[k * 2 + 1] + self.seg_add[k * 2 + 1],
self.seg_min[k * 2 + 2] + self.seg_add[k * 2 + 2],
);
self.seg_max[k] = cmp::max(
self.seg_max[k * 2 + 1] + self.seg_add[k * 2 + 1],
self.seg_max[k * 2 + 2] + self.seg_add[k * 2 + 2],
);
}
} else {
self.add_to_range(a, b, value, k * 2 + 1, left, (left + right) / 2);
self.add_to_range(a, b, value, k * 2 + 2, (left + right) / 2, right);
}
}
pub fn update(&mut self, pos: usize, value: i64) {
let mut k = pos + NUM - 1;
self.seg_min[k] = value;
self.seg_max[k] = value;
while k > 0 {
k = (k - 1) / 2;
self.seg_min[k] = cmp::min(self.seg_min[k * 2 + 1], self.seg_min[k * 2 + 2]);
self.seg_max[k] = cmp::max(self.seg_max[k * 2 + 1], self.seg_max[k * 2 + 2]);
}
}
pub fn get_min(&self, a: usize, b: usize) -> i64 {
get(
&self.seg_min,
&self.seg_add,
INF,
a,
b,
0,
0,
NUM,
&cmp::min,
)
}
pub fn get_max(&self, a: usize, b: usize) -> i64 {
get(
&self.seg_max,
&self.seg_add,
-INF,
a,
b,
0,
0,
NUM,
&cmp::max,
)
}
}
fn get<F>(
seg: &Vec<i64>,
add: &Vec<i64>,
default_value: i64,
a: usize,
b: usize,
k: usize,
left: usize,
right: usize,
f: &F,
) -> i64
where
F: Fn(i64, i64) -> i64,
{
if b <= left || right <= a {
default_value
} else if a <= left && right <= b {
seg[k] + add[k]
} else {
let mid = (left + right) / 2;
let x = get(seg, add, default_value, a, b, k * 2 + 1, left, mid, f);
let y = get(seg, add, default_value, a, b, k * 2 + 2, mid, right, f);
f(x, y) + add[k]
}
}
}
#[cfg(test)]
mod test {
use super::*;
extern crate rand;
use self::rand::Rng;
use std::cmp;
#[test]
fn random_add() {
let n = 30;
let mut array = vec![0; n];
let mut seg = range_add_segment_tree::RangeAddSegmentTree::new();
for i in 0..n {
seg.update(i, 0);
}
for l in 0..n {
for r in (l + 1)..n {
let value = rand::thread_rng().gen::<i16>() as i64;
seg.add(l, r, value);
for i in l..r {
array[i] += value;
}
for l in 0..n {
for r in (l + 1)..n {
let mut min = range_add_segment_tree::INF;
let mut max = -range_add_segment_tree::INF;
for i in l..r {
min = cmp::min(min, array[i]);
max = cmp::max(max, array[i]);
}
assert_eq!(seg.get_min(l, r), min);
assert_eq!(seg.get_max(l, r), max);
}
}
}
}
}
}