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
| #include<cstdio>
#define re register
#define int long long
const int MAXn = 5e5;
template <class T>
inline void read(T &a) {
register char c;while (c = getchar(), (c < '0' || c > '9') && c != '-');register bool f = c == '-';register T x = f ? 0 : c - '0';while (c = getchar(), c >= '0' && c <= '9') {x = (x << 3) + (x << 1) + c - '0';}a = f ? -x : x;
}
int n, t[MAXn + 10];
#define lowbit(x) ((x) & (-(x))
void BuildUseSum(int *sum) {
for (re int i = 1; i <= n; ++i) {
t[i] = sum[i] - sum[i - lowbit(i)];
}
}
void Add(int p, int v) {
while (p <= n) {
t[p] += v;
p += lowbit(p);
}
}
int EvaSum(int p) {
int ans = 0;
while (p) {
ans += t[p];
p -= lowbit(p);
}
return ans;
}
int a[MAXn + 10], m;
signed main() {
read(n), read(m);
for (re int i = 1; i <= n; ++i) {
read(a[i]);
}
BuildUseSum(a);
for (re int i = 1, opt, x, y, k; i <= m; ++i) {
read(opt);
switch (opt) {
case 1:
read(x), read(y), read(k);
Add(x, k); Add(y + 1, -k);
break;
case 2:
read(x);
printf("%lld\n", EvaSum(x));
break;
}
}
}
|
