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

Required by

• src/data-structure/segment-tree/presets/monoid/combined-structure-add-maximum.hpp
• src/data-structure/segment-tree/presets/monoid/combined-structure-update-maximum.hpp
• 区間加算 + 区間最大クエリ solver (Range Add Range Maximum Query Solver) (src/data-structure/segment-tree/presets/range-add-range-maximum-query-solver.hpp)
• 一点更新 + 区間最大クエリ solver (Range Maximum Query Solver) (src/data-structure/segment-tree/presets/range-maximum-query-solver.hpp)
• 区間更新 + 区間最大クエリ solver (Range Update Range Maximum Query Solver) (src/data-structure/segment-tree/presets/range-update-range-maximum-query-solver.hpp)

Verified with

• test/aoj/dsl_2_f/range-maximum.test.cpp
• test/aoj/dsl_2_h/range-maximum.test.cpp
• test/atcoder/abc298_f.test.cpp

Code

#pragma once

#include <algorithm>
#include <limits>

namespace luz::monoid {

  template < typename T >
  class RangeMaximumQueryMonoid {

    static constexpr T identity_{std::numeric_limits< T >::min()};

   public:
    using value_type = T;

    static constexpr T operation(T a, T b) {
      return std::max(a, b);
    }

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

} // namespace luz::monoid

#line 2 "src/data-structure/segment-tree/presets/monoid/value-structure-maximum.hpp"

#include <algorithm>
#include <limits>

namespace luz::monoid {

  template < typename T >
  class RangeMaximumQueryMonoid {

    static constexpr T identity_{std::numeric_limits< T >::min()};

   public:
    using value_type = T;

    static constexpr T operation(T a, T b) {
      return std::max(a, b);
    }

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

} // namespace luz::monoid

Back to top page