Pagini recente » Cod sursa (job #1720046) | Cod sursa (job #1560717) | Cod sursa (job #1733844) | Cod sursa (job #2586490) | Cod sursa (job #1279518)
#include <stdio.h>
#include <stdlib.h>
#define N_MAX 100000
int aib[N_MAX+1];
int aibSize;
void adauga(int val, int x ) {
do {
aib[x] += val;
x += x & -x;
} while ( x <= aibSize );
}
int suma(int x) {
int s = 0;
while (x) {
s += aib[x];
x &= x - 1;
}
return s;
}
int cauta (int val) {
int x = 0;
int interval = aibSize / 2;
while (interval) {
if ( aib[ x + interval] < val ) {
val -= aib[x + interval];
x += interval;
}
interval >>= 1;
}
return x+1;
}
int main()
{
FILE *in = fopen("aib.in","r");
FILE *out = fopen("aib.out","w");
int operatii;
fscanf(in, "%d %d", &aibSize, &operatii);
int i, val;
for ( i = 1; i <= aibSize; i++ ) {
fscanf(in, "%d", &val);
adauga(val,i);
}
int alegere, a, b;
for ( i = 1; i <= operatii; i++ ) {
fscanf(in,"%d",&alegere);
switch (alegere) {
case 0:
fscanf(in,"%d %d", &a, &b);
adauga(b,a);
break;
case 1:
fscanf(in,"%d %d",&a,&b);
fprintf(out,"%d\n", suma(b) - suma(a-1));
break;
case 2:
fscanf(in,"%d",&a);
fprintf(out,"%d\n",cauta(a));
break;
}
}
fclose(in);
fclose(out);
return 0;
}