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
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 50;
int n, m;
ll a[maxn];
struct {
int l, r;
ll mx, sum;
#define l(x) tr[x].l
#define r(x) tr[x].r
#define mx(x) tr[x].mx
#define sum(x) tr[x].sum
#define lc(x) x * 2
#define rc(x) x * 2 + 1
} tr[4 * maxn];
void up(int p) {
sum(p) = sum(lc(p)) + sum(rc(p));
mx(p) = max(mx(lc(p)), mx(rc(p)));
}
void build(int p, int l, int r) {
l(p) = l, r(p) = r;
if (l == r) {
mx(p) = sum(p) = a[l];
return;
}
int mid = (l + r) / 2;
build(lc(p), l, mid), build(rc(p), mid + 1, r);
up(p);
}
void update(int p, int l, int r) {
if (l <= l(p) && r(p) <= r && l(p) == r(p)) {
mx(p) = sqrt(mx(p));
sum(p) = sqrt(sum(p));
return;
}
int mid = (l(p) + r(p)) / 2;
if (l <= mid && mx(lc(p)) > 1) update(lc(p), l, r);
if (r > mid && mx(rc(p)) > 1) update(rc(p), l, r);
up(p);
}
ll ask(int p, int l, int r) {
if (l(p) >= l && r(p) <= r) return sum(p);
int mid = (l(p) + r(p)) / 2;
ll ans = 0;
if (l <= mid) ans += ask(lc(p), l, r);
if (r > mid) ans += ask(rc(p), l, r);
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
build(1, 1, n);
scanf("%d", &m);
int opt, x, y;
while (m--) {
scanf("%d%d%d", &opt, &x, &y);
if (x > y) swap(x, y);
if (opt == 0) {
update(1, x, y);
} else {
printf("%lld\n", ask(1, x, y));
}
}
return 0;
}
|