src/data-structure/segment-tree/presets/monoid/operator-structure-add.hpp

• View this file on GitHub
• Last update: 2023-05-03 14:59:16+09:00
• Include: #include "src/data-structure/segment-tree/presets/monoid/operator-structure-add.hpp"

Required by

• src/data-structure/segment-tree/presets/monoid/combined-structure-add-maximum.hpp
• src/data-structure/segment-tree/presets/monoid/combined-structure-add-minimum.hpp
• src/data-structure/segment-tree/presets/monoid/combined-structure-add-sum.hpp
• 区間加算クエリ solver (Range Add Query Solver) (src/data-structure/segment-tree/presets/range-add-query-solver.hpp)
• 区間加算 + 区間最大クエリ solver (Range Add Range Maximum Query Solver) (src/data-structure/segment-tree/presets/range-add-range-maximum-query-solver.hpp)
• 区間加算 + 区間最小クエリ solver (Range Add Range Minimum Query Solver) (src/data-structure/segment-tree/presets/range-add-range-minimum-query-solver.hpp)
• 区間加算 + 区間和クエリ solver (Range Add Range Sum Query Solver) (src/data-structure/segment-tree/presets/range-add-range-sum-query-solver.hpp)

Verified with

• test/aoj/dsl_2_e.test.cpp
• test/aoj/dsl_2_g.test.cpp
• test/aoj/dsl_2_h/range-maximum.test.cpp
• test/aoj/dsl_2_h/range-minimum.test.cpp

Code

#pragma once

namespace luz::monoid {

  template < typename T >
  class RangeAddQueryMonoid {

   public:
    using value_type = T;

    static constexpr T operation(T a, T b) {
      return a + b;
    }

    static constexpr T identity() {
      return T();
    }
  };

} // namespace luz::monoid

#line 2 "src/data-structure/segment-tree/presets/monoid/operator-structure-add.hpp"

namespace luz::monoid {

  template < typename T >
  class RangeAddQueryMonoid {

   public:
    using value_type = T;

    static constexpr T operation(T a, T b) {
      return a + b;
    }

    static constexpr T identity() {
      return T();
    }
  };

} // namespace luz::monoid

Back to top page