dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
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

use crate::segment_tree_with_instance_monoid::*;

pub struct RangeMinimum<T>(T);

impl<T> RangeMinimum<T> {
    pub fn new(inf: T) -> Self {
        Self(inf)
    }
}

impl<T: Ord + Clone> Monoid for RangeMinimum<T> {
    type T = T;

    fn e(&self) -> Self::T {
        self.0.clone()
    }

    fn op(
        &self,
        l: Self::T,
        r: Self::T,
    ) -> Self::T {
        l.min(r)
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        // ref: https://atcoder.jp/contests/practice2/tasks/practice2_j
        let cases = vec![(
            vec![1, 2, 3, 2, 1],
            vec![
                ((2, 1, 5), 3),
                ((3, 2, 3), 3),
                ((1, 3, 1), -1),
                ((2, 2, 4), 2),
                ((3, 1, 3), 6),
            ],
        )];

        for (a, q) in cases {
            let n = a.len();

            let mut seg = SegmentTree::new(RangeMinimum::new(1 << 30), n);

            for i in 0..n {
                seg.set(i, -a[i]);
            }

            for ((t, x, y), ans) in q {
                if t == 1 {
                    seg.set(x as usize - 1, -y);
                } else if t == 2 {
                    assert_eq!(-seg.fold(x as usize - 1, y as usize), ans);
                } else {
                    assert_eq!(
                        seg.max_right(|v| v > &-y, x as usize - 1) + 1,
                        ans as usize,
                    );
                }
            }
        }
    }
}