monoid/add_count.hpp

• View this file on GitHub
• Last update: 2021-04-15 20:24:09+09:00
• Include: #include "monoid/add_count.hpp"

Verified with

• 遅延セグメント木 (区間加算・区間和) (test/aoj/DSL_2_G.test.cpp)

Code

#ifndef __MONOID__ADD__COUNT
#define __MONOID__ADD__COUNT
#include <algorithm>
#include <utility>
#include <limits>

namespace monoid {
template <class T>
struct add_count {
  typedef std::pair<T,T> value_t;
  value_t identity() const { return std::make_pair(T(),T()); }
  value_t merge(value_t a, value_t b) const { return std::make_pair(a.first+b.first, a.second+b.second); }
};
} // namespace monoid

#endif // __MONOID__ADD__COUNT

#line 1 "monoid/add_count.hpp"


#include <algorithm>
#include <utility>
#include <limits>

namespace monoid {
template <class T>
struct add_count {
  typedef std::pair<T,T> value_t;
  value_t identity() const { return std::make_pair(T(),T()); }
  value_t merge(value_t a, value_t b) const { return std::make_pair(a.first+b.first, a.second+b.second); }
};
} // namespace monoid

Back to top page