Pagini recente » Cod sursa (job #2008624) | tabletennis | Rating Hodoroaba Emanuel (EmiH) | Cod sursa (job #1041749) | Cod sursa (job #1183076)
#include <stdio.h>
#define MAXN 100000
int aib[MAXN+1], n;
inline int ub(int a){
return a&(-a);
}
inline void add(int poz, int val){
int i;
for(i=poz; i<=n; i+=ub(i)){
aib[i]+=val;
}
}
inline int sum(int a){
int i, s;
s=0;
for(i=a; i!=0; i-=ub(i)){
s+=aib[i];
}
return s;
}
int main(){
int m, i, x, t, a, b, rez, pas;
FILE *fin, *fout;
fin=fopen("aib.in", "r");
fout=fopen("aib.out", "w");
fscanf(fin, "%d%d", &n, &m);
for(i=1; i<=n; i++){
fscanf(fin, "%d", &x);
add(i, x);
}
for(i=1; i<=m; i++){
fscanf(fin, "%d", &t);
switch(t){
case 0 :
fscanf(fin, "%d%d", &a, &b);
add(a, b);
break;
case 1 :
fscanf(fin, "%d%d", &a, &b);
fprintf(fout, "%d\n", sum(b)-sum(a-1));
break;
default :
fscanf(fin, "%d", &a);
rez=0;
for(pas=1<<16; pas!=0; pas>>=1){
if((pas+rez<=n)&&(sum(rez+pas)<a)){
rez+=pas;
}
}
rez++;
if(sum(rez)==a){
fprintf(fout, "%d\n", rez);
}else{
fprintf(fout, "-1\n");
}
break;
}
}
fclose(fin);
fclose(fout);
return 0;
}