Pagini recente » Cod sursa (job #2909361) | Cod sursa (job #419406) | Cod sursa (job #2341408) | Cod sursa (job #213341) | Cod sursa (job #1875905)
#include<cstdio>
#define aibSize 100001
using namespace std;
int aib[aibSize], n;
void updateAib(int val, int x)
{
while(x <= n)
{
aib[x]+=val;
x += x & -x;
}
}
int suma(int x)
{
int s = 0;
while(x)
{
s += aib[x];
x &= x-1;
}
return s;
}
int BSearch(int x)
{
int left, right, mid, sum;
left = 1; right = n;
while(left <= right)
{
mid = (left+right)>>1;
sum = suma(mid);
if(sum == x) return mid;
else if(sum < x) left = mid+1;
else right = mid-1;
}
return -1;
}
int main()
{
int i, m, x, nr, a, b;
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);
updateAib(x,i);
}
for(i=1; i<=m; i++)
{
fscanf(fin,"%d",&nr);
if(!nr)
{
fscanf(fin,"%d%d",&a,&b);
updateAib(b,a);
}
else if(nr == 1)
{
fscanf(fin,"%d%d",&a,&b);
fprintf(fout,"%d\n",suma(b)-suma(a-1));
}
else
{
fscanf(fin,"%d",&a);
fprintf(fout,"%d\n",BSearch(a));
}
}
fclose(fin);
fclose(fout);
return 0;
}