Pagini recente » Cod sursa (job #1411507) | Cod sursa (job #2652028) | Cod sursa (job #583127) | Cod sursa (job #2375230) | Cod sursa (job #141659)
Cod sursa(job #141659)
#ifdef WIN32
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <stdio.h>
int s[16][16384];
int log2(int n)
{
int l = 0, p = 1;
while (n > p)
{
p <<= 1;
l++;
}
return l;
}
int suma(int a, int b)
{
if (a > b)
return 0;
if (a == b)
return s[0][a];
int l = log2(b - a + 1);
if ((a >> l) << l == a && b - a + 1 == (1 << l))
return s[l][a >> l];
l--;
int c = (b >> l) << l;
if (a < c)
return suma(a, c - 1) + suma(c, b);
else
return s[0][a] + suma(a + 1, b);
}
int main()
{
freopen("datorii.in", "r", stdin);
freopen("datorii.out", "w", stdout);
int n, m, l, i, j, o, a, b;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++)
scanf("%d", &s[0][i]);
l = log2(n);
for (i = 1; i <= l; i++)
for (j = 0; j <= (n >> i); j++)
s[i][j] = s[i - 1][j << 1] + s[i - 1][(j << 1) + 1];
for (i = 0; i < m; i++)
{
scanf("%d%d%d", &o, &a, &b);
if (o == 0)
{
a--;
for (j = 0; j <= l; j++)
s[j][a >> j] -= b;
}
else
printf("%d\n", suma(a - 1, b - 1));
}
return 0;
}