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

pub mod range_add_segment_tree {
    use std::ops::Add;

    pub struct RangeAddSegmentTree<T, F> {
        seg: Vec<T>,
        seg_add: Vec<T>,
        num: usize,
        f: F,
        init: T,
    }

    impl<T, F> RangeAddSegmentTree<T, F>
    where
        T: PartialOrd + Add<Output = T> + Copy,
        F: Fn(T, T) -> T + Copy,
    {
        pub fn new(n: usize, init: T, f: F, zero: T) -> Self {
            let num = n.next_power_of_two();
            RangeAddSegmentTree {
                seg: vec![init; num * 2],
                seg_add: vec![zero; num * 2],
                num: num,
                init: init,
                f: f,
            }
        }

        /// add to [a, b)
        pub fn add(&mut self, a: usize, b: usize, value: T) {
            self.add_to_range(a, b, value, 0, 0, self.num);
        }

        fn add_to_range(
            &mut self,
            a: usize,
            b: usize,
            value: T,
            mut k: usize,
            left: usize,
            right: usize,
        ) {
            if b <= left || right <= a {
                return;
            }
            if a <= left && right <= b {
                self.seg_add[k] = self.seg_add[k] + value;
                while k > 0 {
                    k = (k - 1) / 2;
                    self.seg[k] = (self.f)(
                        self.seg[k * 2 + 1] + self.seg_add[k * 2 + 1],
                        self.seg[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: T) {
            let mut k = pos + self.num - 1;
            self.seg[k] = value;
            while k > 0 {
                k = (k - 1) / 2;
                self.seg[k] = (self.f)(self.seg[k * 2 + 1], self.seg[k * 2 + 2]);
            }
        }

        pub fn get(&self, a: usize, b: usize) -> T {
            self.get_from_range(a, b, 0, 0, self.num)
        }

        fn get_from_range(&self, a: usize, b: usize, k: usize, left: usize, right: usize) -> T {
            if b <= left || right <= a {
                self.init
            } else if a <= left && right <= b {
                self.seg[k] + self.seg_add[k]
            } else {
                let mid = (left + right) / 2;
                let x = self.get_from_range(a, b, k * 2 + 1, left, mid);
                let y = self.get_from_range(a, b, k * 2 + 2, mid, right);
                (self.f)(x, y) + self.seg_add[k]
            }
        }
    }
}

#[cfg(test)]
mod test {
    use super::*;
    use rand::Rng;
    use std::cmp;

    const INF: i64 = 1 << 60;

    #[test]
    fn random_add() {
        let n = 32;
        let mut array = vec![0; n];
        let mut seg_min = range_add_segment_tree::RangeAddSegmentTree::new(
            n,
            INF,
            |a, b| if a > b { b } else { a },
            0,
        );
        let mut seg_max = range_add_segment_tree::RangeAddSegmentTree::new(
            n,
            -INF,
            |a, b| if a < b { b } else { a },
            0,
        );
        for i in 0..n {
            let value = rand::thread_rng().gen::<i16>() as i64;
            array[i] = value;
            seg_min.update(i, value);
            seg_max.update(i, value);
        }

        for l in 0..n {
            for r in (l + 1)..n {
                let value = rand::thread_rng().gen::<i16>() as i64;
                seg_min.add(l, r, value);
                seg_max.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 = INF;
                        let mut max = -INF;
                        for i in l..r {
                            min = cmp::min(min, array[i]);
                            max = cmp::max(max, array[i]);
                        }

                        assert_eq!(seg_min.get(l, r), min);
                        assert_eq!(seg_max.get(l, r), max);
                    }
                }
            }
        }
    }
}