MonoidRangeMinPointUpdate - [区間min, 点更新]
(lib/99-operator/monoid/MonoidRangeMinPointUpdate.cpp)

• View this file on GitHub
• Last update: 2023-05-30 04:39:19+09:00

Verified with

• test/binary-search-tree/RandomizedBinarySearchTreeSequence-insert-erase.test.cpp
• test/binary-search-tree/RandomizedBinarySearchTreeSequence-rmq.test.cpp
• test/segment-tree/SegmentTree-rmq.test.cpp

Code

/*
 * @title MonoidRangeMinPointUpdate - [区間min, 点更新]
 * @docs md/operator/monoid/MonoidRangeMinPointUpdate.md
 */
template<class T> struct MonoidRangeMinPointUpdate {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = (1LL<<31)-1;
    inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return min(l,r);}
    inline static constexpr TypeNode func_operate(TypeNode l,TypeNode r){return r;}
    inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var > nodeVal;}
};

#line 1 "lib/99-operator/monoid/MonoidRangeMinPointUpdate.cpp"
/*
 * @title MonoidRangeMinPointUpdate - [区間min, 点更新]
 * @docs md/operator/monoid/MonoidRangeMinPointUpdate.md
 */
template<class T> struct MonoidRangeMinPointUpdate {
    using TypeNode = T;
    inline static constexpr TypeNode unit_node = (1LL<<31)-1;
    inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return min(l,r);}
    inline static constexpr TypeNode func_operate(TypeNode l,TypeNode r){return r;}
    inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var > nodeVal;}
};

Back to top page