#include<bits/allocator.h> #pragma GCC optimize("Ofast,unroll-loops") #pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt,tune=native") #include<bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define int128 __int128_t #define double long double #define gcd __gcd #define lcm(a, b) ((a)/gcd(a, b)*(b)) #define sqrt sqrtl #define log2 log2l #define log10 log10l #define floor floorl #define yes cout << "YES" #define no cout << "NO" #define trav(i, a) for (auto &i: (a)) #define all(a) (a).begin(), (a).end() #define rall(a) (a).rbegin(), (a).rend() #define sz(a) (int)a.size() #define Max(a) *max_element(all(a)) #define Min(a) *min_element(all(a)) #define Find(a, n) (find(all(a), n) - a.begin()) #define Count(a, n) count(all(a), n) #define Upper(a, n) (upper_bound(all(a), n) - a.begin()) #define Lower(a, n) (lower_bound(all(a), n) - a.begin()) #define next_perm(a) next_permutation(all(a)) #define prev_perm(a) prev_permutation(all(a)) #define sorted(a) is_sorted(all(a)) #define sum(a) accumulate(all(a), 0) #define sumll(a) accumulate(all(a), 0ll) #define Sort(a) sort(all(a)) #define Reverse(a) reverse(all(a)) #define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin()) #define pb push_back #define eb emplace_back #define popcount __builtin_popcount #define popcountll __builtin_popcountll #define clz __builtin_clz #define clzll __builtin_clzll #define ctz __builtin_ctz #define ctzll __builtin_ctzll #define open(s) freopen(s, "r", stdin) #define write(s) freopen(s, "w", stdout) #define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str()); #define For(i, a, b) for (auto i = (a); i < (b); ++i) #define Fore(i, a, b) for (auto i = (a); i >= (b); --i) #define FOR(i, a, b) for (auto i = (a); i <= (b); ++i) #define ret(s) return void(cout << s); constexpr int mod = 1e9 + 7, mod2 = 998244353; constexpr double eps = 1e-9; const double PI = acos(-1); constexpr ull npos = string::npos; constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1}; using pii = pair<int, int>; using pll = pair<ll, ll>; using cd = complex<double>; mt19937 mt(chrono::system_clock::now().time_since_epoch().count()); mt19937_64 mt64(chrono::system_clock::now().time_since_epoch().count()); typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vll; typedef vector<vll> vvll; typedef vector<double> vdo; typedef vector<vdo> vvdo; typedef vector<string> vs; typedef vector<pii> vpair; typedef vector<vpair> vvpair; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vector<char> vc; typedef vector<vc> vvc; typedef vector<cd> vcd; typedef priority_queue<int> pq; typedef priority_queue<int, vi, greater<int>> pqg; typedef priority_queue<ll> pqll; typedef priority_queue<ll, vll, greater<ll>> pqgll; // ll add(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);a+=b;return a >= m ? a - m: a;} // ll sub(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);a-=b;return a < 0 ? a + m: a;} // ll mul(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);return a*b % m;} ll bin_mul(ll a, ll b, ll m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;} ll bin_pow(ll a, ll b, ll m) {ll x = 1;a = (a >= m ? a % m: a); while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;} ll power(ll a, ll b, int m) {ll x = 1;a = (a >= m ? a % m: a); while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;} ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;} ll ceil(ll a, ll b) {return (a + b - 1)/b;} ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);} bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;} bool is_square(ll n) {ll k = sqrt(n); return k*k == n;} ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; ++i) x*=i;return x;} ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; ++i) x = x*i % m;return x;} bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;} string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;} string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;} string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;} void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}} void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}} void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}} void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}} vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; ++i) {if (n % i == 0) {int k = 0; while (n % i == 0) ++k, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;} int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);} ll rand(ll l, ll r) {return uniform_int_distribution<ll>(l, r)(mt64);} int Log2(int n) {return 31 - __builtin_clz(n);} ll Log2(ll n) {return 63 - __builtin_clzll(n);} template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;} template<class A, class B> bool ckmin(A &a, const B &b) {return a > b ? a = b, 1: 0;} template<class A, class B> bool ckmax(A &a, const B &b) {return a < b ? a = b, 1: 0;} template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;} template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;} template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;} template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;} template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;} template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;} template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;} template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;} // istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) a = a*10 + s[i] - '0'; a*=(s[0] == '-' ? -1: 1); return in;} // ostream& operator<<(ostream& out, __int128_t a) {string s = ""; if (a < 0) out << '-', a = -a; if (a == 0) s+='0'; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;} struct node { ll l, r; int p, s, t, v; ll x; node(ll l = 0, ll r = 0, int p = 0, int s = 0, int t = 0, int v = 0, ll x = 0): l(l), r(r), p(p), s(s), t(t), v(v), x(x) {} }; node operator+(const node &a, const node &b) { if (a.t == -1) return b; if (b.t == -1) return a; node c; c.l = a.l, c.r = b.r, c.t = a.t + b.t; c.p = a.p, c.s = b.s, c.v = max(a.v, b.v), c.x = a.x + b.x; if (a.r == b.l) { if (a.p == a.t) c.p+=b.p; if (b.s == b.t) c.s+=a.s; ckmax(c.v, a.s + b.p); } return c; } node single(ll v) { return node(v, v, 1, 1, 1, 1, v); } constexpr int N = 300001; constexpr ll inf = 1e18; int n, q; ll d[N], a[4*N], b[4*N]; node t[4*N]; void pull(int x) { t[x] = t[x << 1] + t[x << 1|1]; } void apply(int x, ll A, ll B) { if (A != inf) t[x].l = t[x].r = A + B, t[x].x = (A + B)*t[x].t, t[x].p = t[x].s = t[x].v = t[x].t, a[x] = A, b[x] = B; else t[x].l+=B, t[x].r+=B, t[x].x+=B*t[x].t, b[x]+=B; } void push(int x) { apply(x << 1, a[x], b[x]), apply(x << 1|1, a[x], b[x]); a[x] = inf, b[x] = 0; } void build(int x, int l, int r) { a[x] = inf; if (l == r) { t[x] = single(d[l]); return; } int m = (l + r) >> 1; build(x << 1, l, m), build(x << 1|1, m + 1, r); pull(x); } void add(int x, int lx, int rx, int l, int r, ll v) { if (lx > r || rx < l) return; if (lx >= l && rx <= r) { apply(x, inf, v); return; } push(x); int m = (lx + rx) >> 1; add(x << 1, lx, m, l, r, v), add(x << 1|1, m + 1, rx, l, r, v); pull(x); } void upd(int x, int lx, int rx, int l, int r, ll v) { if (lx > r || rx < l) return; if (lx >= l && rx <= r) { apply(x, v, 0); return; } push(x); int m = (lx + rx) >> 1; upd(x << 1, lx, m, l, r, v), upd(x << 1|1, m + 1, rx, l, r, v); pull(x); } node get(int x, int lx, int rx, int l, int r) { if (lx > r || rx < l) return node(0, 0, 0, 0, -1); if (lx >= l && rx <= r) return t[x]; push(x); int m = (lx + rx) >> 1; return get(x << 1, lx, m, l, r) + get(x << 1|1, m + 1, rx, l, r); } void add(int l, int r, ll v) {add(1, 2, n, l, r, v);} void upd(int l, int r, ll v) {upd(1, 2, n, l, r, v);} node get(int l, int r) {return get(1, 2, n, l, r);} int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); cout << fixed << setprecision(10); cin >> n >> q; FOR(i,1,n) cin >> d[i]; if (n == 1) { while (q--) { int o, l, r; cin >> o >> l >> r; if (o == 3) cout << "1\n"; else { ll S, C; cin >> S >> C; } } return 0; } ll fi = d[1]; Fore(i,n,2) d[i]-=d[i - 1]; build(1, 2, n); // cout << fi << ' '; // FOR(i,2,n) cout << fi + get(2, i).x << ' '; // cout << endl; while (q--) { int o, l, r; cin >> o >> l >> r; if (o == 3) { if (l == r) cout << "1\n"; else cout << get(l + 1, r).v + 1 << '\n'; } else { ll S, C; cin >> S >> C; ll A = C, B = S - l*C; // cout << A << ' ' << B << endl; if (o == 1) { if (l < r) add(l + 1, r, A); if (l > 1) add(l, l, A*l + B); if (r < n) add(r + 1, r + 1, -A*r - B); } else { ll u = 0, v = 0; if (l > 1) u = fi + (l > 2 ? get(2, l - 1).x: 0); if (r < n) v = fi + get(2, r + 1).x; if (l < r) upd(l + 1, r, A); if (l > 1) upd(l, l, A*l + B - u); if (r < n) upd(r + 1, r + 1, v - A*r - B); } if (l == 1) { if (o == 1) fi+=S; else fi = S; } // cout << fi << ' '; // FOR(i,2,n) cout << fi + get(2, i).x << ' '; // cout << endl; } } cerr << "\nProcess returned 0 (0x0) execution time : " << 1.0*clock()/CLOCKS_PER_SEC << " s"; return 0; }