monoids/plus.hpp

• View this file on GitHub
• Last update: 2019-12-27 19:16:13+09:00
• Include: #include "monoids/plus.hpp"

Required by

• monoids/plus_max_action.hpp
• monoids/plus_min_action.hpp
• monoids/plus_min_count_action.hpp

Verified with

• data_structure/binary_indexed_tree.test.cpp
• data_structure/dynamic_connectivity_offline.dynamic_graph_vertex_add_component_sum.test.cpp
• data_structure/euler_tour_subtree_query.vertex_add_subtree_sum.test.cpp
• data_structure/lazy_propagation_segment_tree.range_min_range_add.test.cpp
• data_structure/link_cut_tree.dynamic_tree_vertex_add_path_sum.test.cpp
• data_structure/link_cut_tree.vertex_add_path_sum.test.cpp
• data_structure/segment_tree.point_add_range_sum.test.cpp
• data_structure/segment_tree.range_sum_query.test.cpp
• utils/dsu_on_tree.aoj.test.cpp
• utils/mo_algorithm.yuki1270.test.cpp

Code

#pragma once

template <class T>
struct plus_monoid {
    typedef T value_type;
    value_type unit() const { return value_type(); }
    value_type mult(value_type a, value_type b) const { return a + b; }
};

#line 2 "monoids/plus.hpp"

template <class T>
struct plus_monoid {
    typedef T value_type;
    value_type unit() const { return value_type(); }
    value_type mult(value_type a, value_type b) const { return a + b; }
};

Back to top page