src/data-structure/segment-tree/presets/monoid/operator-structure-update.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-update.hpp"

Required by

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

Verified with

• test/aoj/dsl_2_d.test.cpp
• test/aoj/dsl_2_f/range-maximum.test.cpp
• test/aoj/dsl_2_f/range-minimum.test.cpp
• test/aoj/dsl_2_i.test.cpp

Code

#pragma once

namespace luz::monoid {

  template < typename T, T ID >
  class RangeUpdateQueryMonoid {

   public:
    using value_type = T;

    static constexpr T operation(T a, T b) {
      return b == ID ? a : b;
    }

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

} // namespace luz::monoid

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

namespace luz::monoid {

  template < typename T, T ID >
  class RangeUpdateQueryMonoid {

   public:
    using value_type = T;

    static constexpr T operation(T a, T b) {
      return b == ID ? a : b;
    }

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

} // namespace luz::monoid

Back to top page