数列 - 区間代入 RMQ

概要

モノイド \(X\) 上の数列 \[(x_1, \ldots, x_N \mid x_i \in X)\] について次の2つが高速に操作できる

• 区間の最大値/最小値の計算
  • 添字区間 \(I\) について, \(\max \{ x_i \mid i \in I\}\) または \(\min \{ x_i \mid i \in I \}\)
• 区間への 代入
  • 添字区間 \(I\) について, \(x_i \leftarrow x\) for each \(i \in I\)

/// Sequence - Lazy Segment Tree - Ranged Assign/RMQ
use crate::algebra::act_assign::*;
use crate::algebra::monoid_max::*;
use crate::algebra::monoid_min::*;
use crate::sequence::tree::lazy_segment_tree::*;

pub type RangedAssignRMaxQ<X> = LazySegmentTree<MaxInt<X>, Assign<MaxInt<X>>>;
pub type RangedAssignRMinQ<X> = LazySegmentTree<MinInt<X>, Assign<MinInt<X>>>;

#[cfg(test)]
mod test_ranged_assign_rmq {
    use crate::sequence::tree::ranged_assign_rmq::*;

    #[test]
    fn it_works() {
        let v: Vec<i64> = vec![1, 2, 3, 4];
        let mut rmq = RangedAssignRMaxQ::from(v.iter().map(|&x| MaxInt::Val(x)).collect());
        assert_eq!(rmq.product(1..3), MaxInt::Val(3));

        rmq.update(1..3, Assign::Some(MaxInt::Val(1))); // [1,1,1,4]
        assert_eq!(rmq.product(1..3), MaxInt::Val(1));
        assert_eq!(rmq.product(2..4), MaxInt::Val(4));
    }
}