class AtCoder::SegTree(T)

• AtCoder::SegTree(T)
• Reference
• Object

Overview

Implements atcoder::segtree.

The identity element will be implicitly defined as nil, so you don't have to manually define it. In the other words, you cannot include nil into an element of the monoid.

tree = AtCoder::SegTree.new((0...100).to_a) { |a, b| [a, b].min }
tree[10...50] # => 10

Defined in:

seg_tree.cr

Constructors

• .new(values : Array(T))
• .new(values : Array(T), &operator : T, T -> T)

Instance Method Summary

• #[](index : Int)

  Implements atcoder::segtree.get(index)

• #[](range : Range)

  Implements atcoder::segtree.prod(l, r)

• #[]=(index : Int, value : T)

  Implements atcoder::segtree.set(index, value)

• #all_prod

  Implements atcoder::segtree.all_prod(l, r)

• #get(index : Int)

  Implements atcoder::segtree.get(index) alias of .[]

• #max_right(left, e : T | Nil = nil, & : T -> Bool)

  Implements atcoder::lazy_segtree.max_right(left, g).

• #min_left(right, e : T | Nil = nil, & : T -> Bool)

  Implements atcoder::lazy_segtree.min_left(right, g).

• #prod(left : Int, right : Int)

  Implements atcoder::segtree.prod(left, right)

• #set(index : Int, value : T)

  Implements atcoder::segtree.set(index, value) alias of .[]=

• #values : Array(T)

Constructor Detail

Instance Method Detail