This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ruthen71/rcpl
#include "data_structure/cumulative_sum.hpp"
使い方
sum(l, r)
A[l] + A[l + 1] + ... + A[r - 1]
n
imos(l, r, z)
build()
rui.get(p)
#pragma once template <class T> struct CumulativeSum { int n; std::vector<T> seg; CumulativeSum() = default; CumulativeSum(int n) : n(n), seg(n + 1, T(0)) {} CumulativeSum(std::vector<T> &a) { n = (int)a.size(); seg.assign(n + 1, T(0)); for (int i = 0; i < n; i++) seg[i + 1] = seg[i] + a[i]; } // [l, r) T sum(int l, int r) const { assert(0 <= l and l <= r and r <= n); return seg[r] - seg[l]; } // A[l] += x, A[l + 1] += x, ... , A[r - 1] += x void imos(int l, int r, T x = T(1)) { assert(0 <= l and l <= r and r <= n); seg[l] += x; seg[r] -= x; } void build() { for (int i = 0; i < n; i++) seg[i + 1] += seg[i]; } // return A[p] T get(int p) const { assert(0 <= p and p < n); return seg[p]; } // output friend std::ostream &operator<<(std::ostream &os, const CumulativeSum &A) { os << "n = " << A.n << "\n"; for (int i = 0; i <= A.n; i++) os << A.seg[i] << " \n"[i == A.n]; return os; } };
#line 2 "data_structure/cumulative_sum.hpp" template <class T> struct CumulativeSum { int n; std::vector<T> seg; CumulativeSum() = default; CumulativeSum(int n) : n(n), seg(n + 1, T(0)) {} CumulativeSum(std::vector<T> &a) { n = (int)a.size(); seg.assign(n + 1, T(0)); for (int i = 0; i < n; i++) seg[i + 1] = seg[i] + a[i]; } // [l, r) T sum(int l, int r) const { assert(0 <= l and l <= r and r <= n); return seg[r] - seg[l]; } // A[l] += x, A[l + 1] += x, ... , A[r - 1] += x void imos(int l, int r, T x = T(1)) { assert(0 <= l and l <= r and r <= n); seg[l] += x; seg[r] -= x; } void build() { for (int i = 0; i < n; i++) seg[i + 1] += seg[i]; } // return A[p] T get(int p) const { assert(0 <= p and p < n); return seg[p]; } // output friend std::ostream &operator<<(std::ostream &os, const CumulativeSum &A) { os << "n = " << A.n << "\n"; for (int i = 0; i <= A.n; i++) os << A.seg[i] << " \n"[i == A.n]; return os; } };