Pagini recente » Cod sursa (job #466627) | Cod sursa (job #2693390) | Cod sursa (job #630279) | Cod sursa (job #1494326) | Cod sursa (job #141360)
Cod sursa(job #141360)
#ifdef WIN32
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <stdio.h>
int s[20][16384];
int log2(int n)
{
int l = 0, p = 1;
while (n > p)
{
p <<= 1;
l++;
}
return l;
}
int suma(int a, int b, int n)
{
if (a > b)
return 0;
if (a == b)
return s[0][a];
int c = (b >> n) << n;
if (a == c && a + (1 << n) - 1 == b)
return s[n][a >> n];
c = (b >> n) << n;
n--;
if (a < c)
return suma(a, c - 1, n) + suma(c, b, n);
else
return suma(a, b, n);
}
int main()
{
freopen("datorii.in", "rt", stdin);
freopen("datorii.out", "wt", stdout);
int n, m, l, i, j, a, b, c;
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", &a, &b, &c);
if (a == 0)
{
b--;
for (j = 0; j <= l; j++)
s[j][b >> j] -= c;
}
else
printf("%d\n", suma(b - 1, c - 1, log2(c - b + 1)));
}
return 0;
}