algebra/acted_monoid/acted_monoid_min_plus.hpp

View this file on GitHub
Last update: 2026-04-11 00:41:57+09:00
Include: #include "algebra/acted_monoid/acted_monoid_min_plus.hpp"

Depends on

Verified with

segment_tree/test/lazy_segment_tree_min_plus.test.cpp

Code

#pragma once

#include "../monoid/monoid_min.hpp"
#include "../monoid/monoid_plus.hpp"

template <class T, T inf> struct ActedMonoidMinPlus {
    using MS = MonoidMin<T, inf>;
    using MF = MonoidPlus<T>;
    using S = typename MS::value_type;
    using F = typename MF::value_type;
    static constexpr S mapping(const F f, const S x, const int size) {
        return x + f;
    }
};

#line 2 "algebra/acted_monoid/acted_monoid_min_plus.hpp"

#line 2 "algebra/monoid/monoid_min.hpp"

template <class T, T inf> struct MonoidMin {
    using value_type = T;
    static constexpr T operation(const T& a, const T& b) noexcept {
        return std::min(a, b);
    }
    static constexpr T identity() noexcept { return inf; }
    static constexpr bool commutative = true;
};
#line 2 "algebra/monoid/monoid_plus.hpp"

template <class T> struct MonoidPlus {
    using value_type = T;
    static constexpr T operation(const T& a, const T& b) noexcept {
        return a + b;
    }
    static constexpr T identity() noexcept { return T(0); }
    static constexpr T inverse(const T& a) noexcept { return -a; }
    static constexpr bool commutative = true;
};
#line 5 "algebra/acted_monoid/acted_monoid_min_plus.hpp"

template <class T, T inf> struct ActedMonoidMinPlus {
    using MS = MonoidMin<T, inf>;
    using MF = MonoidPlus<T>;
    using S = typename MS::value_type;
    using F = typename MF::value_type;
    static constexpr S mapping(const F f, const S x, const int size) {
        return x + f;
    }
};