Pagini recente » Cod sursa (job #583267) | Monitorul de evaluare | Cod sursa (job #3135178) | Cod sursa (job #3125113) | Cod sursa (job #1552478)
#include <stdio.h>
#include <stdlib.h>
int v[15000];
int lsb(int n){
return n&(-n);
}
int query(int a){ // spune ce suma este intre elementele 1-a
int s=0;
while(a>0){
s+=v[a];
a-=lsb(a);
}
return s;
}
void change(int a, int x, int n){ // adauga x la elementul a
while(a<=n){
v[a]+=x;
a+=lsb(a);
}
}
int main()
{
FILE *fin, *fout;
int n,k,op,i,j;
fin=fopen("datorii.in","r");
fout=fopen("datorii.out","w");
fscanf(fin,"%d%d",&n,&k);
for(i=1;i<=n;i++){
fscanf(fin,"%d",&j);
change(i,j,n);
}
for(k;k>0;k--){
fscanf(fin,"%d%d%d",&op,&i,&j);
if(op==0){
change(i,-j,n);
}else{
fprintf(fout,"%d\n",query(j)-query(i-1));
}
}
fclose(fin);
fclose(fout);
return 0;
}