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

Required by

• 区間 chmin クエリ solver (Range ChangeMin Query Solver) (src/data-structure/segment-tree/presets/range-chmin-query-solver.hpp)

Verified with

• test/atcoder/abc179_f/range-chmin.test.cpp

Code

#pragma once

#include <algorithm>
#include <limits>

namespace luz::monoid {

  template < typename T >
  class RangeChminQueryMonoid {
    static constexpr T identity_{std::numeric_limits< T >::max()};

   public:
    using value_type = T;

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

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

} // namespace luz::monoid

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

#include <algorithm>
#include <limits>

namespace luz::monoid {

  template < typename T >
  class RangeChminQueryMonoid {
    static constexpr T identity_{std::numeric_limits< T >::max()};

   public:
    using value_type = T;

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

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

} // namespace luz::monoid

Back to top page