#include <bits/stdc++.h>
typedef long long ll;
class Node {
public:
ll pref, suff, max;
ll ele;
ll size;
Node(ll pref, ll suff, ll max, ll ele, ll size)
: pref(pref), suff(suff), max(max), ele(ele), size(size) {}
Node() {}
bool operator==(const Node &) const = default;
};
class SegmentTree {
public:
std::vector<Node> seg;
ll n;
SegmentTree(ll n) {
this->n = n;
seg.resize(4 * n);
}
Node idt() { return Node(0, 0, 0, -1, 0); }
Node f(Node a, Node b) {
if (a == idt()) {
return b;
}
if (b == idt()) {
return a;
}
Node ans;
ans.pref = a.pref;
if (a.pref == a.size) {
ans.pref += b.pref;
}
ans.suff = b.suff;
if (b.suff == b.size) {
ans.suff += a.suff;
}
ans.max = std::max(ans.max, ans.suff);
ans.max = std::max(ans.max, ans.pref);
ans.max = std::max(ans.max, a.suff + b.pref);
ans.ele = a.ele;
ans.size = a.size + b.size;
return ans;
}
void construct(std::vector<ll> &a, ll v, ll tl, ll tr) {
if (tl == tr) {
if (a[tl] == 0) {
seg[v] = Node(1, 1, 1, a[tl], 1);
} else {
seg[v] = Node(0, 0, 0, a[tl], 1);
}
return;
}
ll tm = (tl + tr) / 2;
construct(a, 2 * v, tl, tm);
construct(a, 2 * v + 1, tm + 1, tr);
seg[v] = f(seg[2 * v], seg[2 * v + 1]);
}
Node query(ll v, ll tl, ll tr, ll l, ll r) {
if (tl > tr || l > r || tr < l || r < tl) {
return idt();
}
if (l <= tl && tr <= r) {
return seg[v];
}
ll tm = (tl + tr) / 2;
return f(query(2 * v, tl, tm, l, r), query(2 * v + 1, tm + 1, tr, l, r));
}
Node query(ll l, ll r) { return query(1, 0, n, l, r); }
void update(ll v, ll tl, ll tr, ll idx, ll del) {
if (tl > tr || (!(tl <= idx && idx <= tr))) {
return;
}
if (tl != tr) {
ll tm = (tl + tr) / 2;
update(2 * v, tl, tm, idx, del);
update(2 * v + 1, tm + 1, tr, idx, del);
seg[v] = f(seg[2 * v], seg[2 * v + 1]);
} else {
seg[v].ele += del;
if (seg[v].ele == 0) {
seg[v] = Node(1, 1, 1, seg[v].ele, 1);
} else {
seg[v] = Node(0, 0, 0, seg[v].ele, 1);
}
}
}
void update(ll idx, ll del) { update(1, 0, n, idx, del); }
};
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
ll n, q;
std::cin >> n >> q;
std::vector<ll> d(n + 1);
for (ll i = 0; i < n; ++i) {
std::cin >> d[i];
}
std::vector<ll> diff(n + 1);
std::adjacent_difference(d.begin(), d.end(), diff.begin());
std::vector<ll> diff_diff(n + 1);
std::adjacent_difference(diff.begin(), diff.end(), diff_diff.begin());
diff_diff[n] = -1e15;
SegmentTree tree(n);
tree.construct(diff_diff, 1, 0, n);
while (q--) {
ll t;
std::cin >> t;
ll l, r;
std::cin >> l >> r;
--l, --r;
if (t == 1) {
ll s, c;
std::cin >> s >> c;
if (l != r) {
tree.update(l, s);
tree.update(l + 1, c - s);
tree.update(r + 1, -c - (r - l) * c - s);
if (r + 2 <= n) {
tree.update(r + 2, (r - l) * c + s);
}
}
} else if (t == 2) {
ll s, c;
std::cin >> s >> c;
} else {
if (l + 2 > r) {
std::cout << r - l + 1 << '\n';
} else {
std::cout << tree.query(l + 2, r).max + 2 << '\n';
}
}
}
}
Compilation message
Progression.cpp:15:8: error: defaulted 'bool Node::operator==(const Node&) const' only available with '-std=c++2a' or '-std=gnu++2a'
15 | bool operator==(const Node &) const = default;
| ^~~~~~~~
