Pagini recente » Cod sursa (job #2503738) | Cod sursa (job #791979) | Cod sursa (job #2392700) | Cod sursa (job #2248349) | Cod sursa (job #2755063)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
int arb[150002], a,b,poz,val;
void update(int p, int st, int dr)
{
if(st==dr)
{
arb[p] += val;
return;
}
int m = (st+dr)/2;
if(poz <= m)
{
update(2*p,st,m);
}
else
{
update(2*p+1,m+1,dr);
}
arb[p]= arb[2*p] + arb[2*p+1];
}
int query(int p, int st, int dr)
{
if(a<=st && dr<=b)
{
return arb[p];
}
int m=(st+dr)/2,m1=0,m2=0;
if(a<=m)
{
m1=query(2*p,st,m);
}
if(b>m)
{
m2=query(2*p+1,m+1,dr);
}
return m1 + m2;
}
int main()
{
int n, m, i, op, p, q, x;
in >> n >> m;
for(i = 1; i <= n; i++)
{
in >> x;
val = x;
poz = i;
update(1, 1, n);
}
for(i = 1; i <= m; i++)
{
in >> op >> p >> q;
a = p;
b = q;
if(op == 0)
{
poz = p;
val = -b;
update(1, 1, n);
}
else if(op == 1)
{
out << query(1,1,n) << '\n';
}
}
}