Pagini recente » Cod sursa (job #1793318) | Cod sursa (job #1132046) | Cod sursa (job #774845) | Cod sursa (job #879845) | Cod sursa (job #781290)
Cod sursa(job #781290)
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int N=15005;
int aib[N],n,m;
int step(int x)
{
return x&(-x);
}
int query(int x)
{
int sum=0;
for(;x;x-=step(x))
sum+=aib[x];
return sum;
}
void update(int x,int val)
{
for(;x<=n;x+=step(x))
aib[x]+=val;
}
int main()
{
int q,x,y;
in>>n>>m;
for(int i=1;i<=n;i++)
{
in>>x;
update(i,x);
}
while(m--)
{
in>>q>>x>>y;
if(q==0)
update(x,-y);
else
out<<(query(y)-query(x-1))<<"\n";
}
return 0;
}