1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
| #include <bits/stdc++.h>
#define int long long
using namespace std;
struct GLS_SEG_TREE
{
#define ls (now << 1)
#define rs (now << 1 | 1)
struct Node
{
int sum, mxa, mxb, second_max, cnt, len;
int tag1, tag2, tag3, tag4;
} tr[2000010];
void pushup(int now)
{
tr[now].sum = tr[ls].sum + tr[rs].sum;
tr[now].mxa = max(tr[ls].mxa , tr[rs].mxa);
tr[now].mxb = max(tr[ls].mxb , tr[rs].mxb);
if (tr[ls].mxa == tr[rs].mxa)
{
tr[now].cnt = tr[ls].cnt + tr[rs].cnt;
tr[now].second_max = max(tr[ls].second_max, tr[rs].second_max);
}
if (tr[ls].mxa > tr[rs].mxa)
{
tr[now].cnt = tr[ls].cnt;
tr[now].second_max = max(tr[ls].second_max, tr[rs].mxa);
}
if (tr[ls].mxa < tr[rs].mxa)
{
tr[now].cnt = tr[rs].cnt;
tr[now].second_max = max(tr[ls].mxa, tr[rs].second_max);
}
}
void fix(int now, int t1, int t2, int t3, int t4)
{
tr[now].sum += t1 * tr[now].cnt + t2 * (tr[now].len - tr[now].cnt);
tr[now].mxb = max(tr[now].mxb, tr[now].mxa + t3);
tr[now].mxa += t1;
tr[now].second_max += t2;
tr[now].tag3 = max(tr[now].tag3, tr[now].tag1 + t3);
tr[now].tag4 = max(tr[now].tag4, tr[now].tag2 + t4);
tr[now].tag1 += t1;
tr[now].tag2 += t2;
}
void pushdown(int now)
{
int mx = max(tr[ls].mxa, tr[rs].mxa);
if (tr[ls].mxa == mx)
{
fix(ls, tr[now].tag1, tr[now].tag2, tr[now].tag3, tr[now].tag4);
}
else
{
fix(ls, tr[now].tag2, tr[now].tag2, tr[now].tag4, tr[now].tag4);
}
if (tr[rs].mxa == mx)
{
fix(rs, tr[now].tag1, tr[now].tag2, tr[now].tag3, tr[now].tag4);
}
else
{
fix(rs, tr[now].tag2, tr[now].tag2, tr[now].tag4, tr[now].tag4);
}
tr[now].tag1 = tr[now].tag2 = tr[now].tag3 = tr[now].tag4 = 0;
}
void build(int now, int l, int r, int *input)
{
tr[now].len = r - l + 1;
if (l == r)
{
tr[now].cnt = 1;
tr[now].mxa = input[l];
tr[now].mxb = input[l];
tr[now].sum = input[l];
tr[now].second_max = -1145141919810;
return;
}
int mid = l + r >> 1;
build(ls, l, mid, input);
build(rs, mid + 1, r, input);
pushup(now);
}
int query_sum(int now, int l, int r, int ll, int rr)
{
if (l > rr || r < ll)
return 0;
if (ll <= l && rr >= r)
return tr[now].sum;
pushdown(now);
int mid = l + r >> 1;
return query_sum(ls, l, mid, ll, rr) + query_sum(rs, mid + 1, r, ll, rr);
}
int query_mxa(int now, int l, int r, int ll, int rr)
{
if (l > rr || r < ll)
return -1145141919810;
if (ll <= l && rr >= r)
return tr[now].mxa;
pushdown(now);
int mid = l + r >> 1;
return max(query_mxa(ls, l, mid, ll, rr), query_mxa(rs, mid + 1, r, ll, rr));
}
int query_mxb(int now, int l, int r, int ll, int rr)
{
if (l > rr || r < ll)
return -1145141919;
if (ll <= l && rr >= r)
return tr[now].mxb;
pushdown(now);
int mid = l + r >> 1;
return max(query_mxb(ls, l, mid, ll, rr), query_mxb(rs, mid + 1, r, ll, rr));
}
void fix_add(int now, int l, int r, int ll, int rr, int val)
{
if (l > rr || r < ll)
return;
if (ll <= l && rr >= r)
{
tr[now].sum += tr[now].len * val;
tr[now].mxa += val;
tr[now].mxb = max(tr[now].mxa, tr[now].mxb);
tr[now].second_max += val;
tr[now].tag1 += val;
tr[now].tag2 += val;
tr[now].tag3 = max(tr[now].tag1, tr[now].tag3);
tr[now].tag4 = max(tr[now].tag2, tr[now].tag4);
return;
}
pushdown(now);
int mid = l + r >> 1;
fix_add(ls, l, mid, ll, rr, val);
fix_add(rs, mid + 1, r, ll, rr, val);
pushup(now);
}
void fix_min(int now, int l, int r, int ll, int rr, int val)
{
if (l > rr || r < ll || val >= tr[now].mxa)
return;
if (ll <= l && rr >= r && tr[now].second_max < val)
{
int k = tr[now].mxa - val;
tr[now].sum -= tr[now].cnt * k;
tr[now].mxa = val;
tr[now].tag1 -= k;
return;
}
pushdown(now);
int mid = l + r >> 1;
fix_min(ls, l, mid, ll, rr, val);
fix_min(rs, mid + 1, r, ll, rr, val);
pushup(now);
}
#undef ls
#undef rs
} sgt;
int input[500010];
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin >> n >> q;
for (int i = 1; i <= n; i++) cin >> input[i];
sgt.build(1, 1, n, input);
while (q--)
{
int op;
cin >> op;
if (op == 1)
{
int l, r, k;
cin >> l >> r >> k;
sgt.fix_add(1, 1, n, l, r, k);
}
if (op == 2)
{
int l, r, v;
cin >> l >> r >> v;
sgt.fix_min(1, 1, n, l, r, v);
}
if (op == 3)
{
int l, r;
cin >> l >> r;
cout << sgt.query_sum(1, 1, n, l, r) << '\n';
}
if (op == 4)
{
int l, r;
cin >> l >> r;
cout << sgt.query_mxa(1, 1, n, l, r) << '\n';
}
if (op == 5)
{
int l, r;
cin >> l >> r;
cout << sgt.query_mxb(1, 1, n, l, r) << '\n';
}
}
}
|
