group/monoid/min-idx.hpp

• View this file on GitHub
• Last update: 2024-07-29 18:44:45+07:00
• Include: #include "group/monoid/min-idx.hpp"

Required by

• group/monoid-action/min-idx-add.hpp

Code

#pragma once

/**
 * Author: Teetat T.
 * Date: 2024-07-21
 * Description: Min Index Monoid class.
 */

template<class T,class IDX=int,bool tie_is_left=true>
struct MinIdxMonoid{
    using P = pair<T,IDX>;
    using value_type = P;
    static constexpr P op(const P &x,const P &y){
        if(x.first<y.first)return x;
        if(x.first>y.first)return y;
        return tie_is_left?x:y;
    }
    static constexpr P unit(){return P(numeric_limits<T>::max(),IDX(-1));}
};

#line 2 "group/monoid/min-idx.hpp"

/**
 * Author: Teetat T.
 * Date: 2024-07-21
 * Description: Min Index Monoid class.
 */

template<class T,class IDX=int,bool tie_is_left=true>
struct MinIdxMonoid{
    using P = pair<T,IDX>;
    using value_type = P;
    static constexpr P op(const P &x,const P &y){
        if(x.first<y.first)return x;
        if(x.first>y.first)return y;
        return tie_is_left?x:y;
    }
    static constexpr P unit(){return P(numeric_limits<T>::max(),IDX(-1));}
};

Back to top page