Pagini recente » Cod sursa (job #1194466) | Cod sursa (job #3139948) | Cod sursa (job #464024) | Cod sursa (job #963958) | Cod sursa (job #3285575)
#include <bits/stdc++.h>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int NMAX = 15000;
int n, m;
int aib[NMAX + 5];
int q, a, b;
void update(int a, int b)
{
for(int i = a; i <= n; i += i & (-i))
{
aib[i] += b;
}
}
int query(int a)
{
int sum = 0;
for(int i = a; i > 0; i -= i & (-i))
{
sum += aib[i];
}
return sum;
}
int main()
{
in >> n >> m;
for(int i = 1; i <= n; ++i)
{
int x;
in >> x;
update(i, x);
}
for(int i = 1; i <= m; ++i)
{
in >> q >> a >> b;
if(q == 0)
{
update(a, -1 * b);
}
else
{
int s1 = query(b);
int s2 = query(a - 1);
out << s1 - s2 << '\n';
}
}
return 0;
}