Struct contest_algorithms::arq_tree::AssignSum

pub struct AssignSum;

Range Sum Query, a slightly trickier classic application of ARQ. modify(l, r, &f) sets all entries a[l..=r] to f. query(l, r) sums all the entries a[l..=r].

Panics

Associated functions will panic on overflow.

Trait Implementations

impl ArqSpec for AssignSum

type F = i64

Type of data representing an endomorphism.

type M = (i64, i64)

Type of monoid elements.

fn compose(f: &Self::F, _: &Self::F) -> Self::F

For eager updates, compose() ho be unimplemented!(). For lazy updates: Require for all f,g,a: apply(compose(f, g), a) = apply(f, apply(g, a))

fn apply(f: &Self::F, (_, s): &Self::M) -> Self::M

For eager updates, apply() can assume to act on a leaf. For lazy updates: Require for all f,a,b: apply(f, op(a, b)) = op(apply(f, a), apply(f, b))

fn op((a, s): &Self::M, (b, t): &Self::M) -> Self::M

Require for all a,b,c: op(a, op(b, c)) = op(op(a, b), c)

fn identity() -> Self::M

Require for all a: op(a, identity()) = op(identity(), a) = a