Pagini recente » Cod sursa (job #1798760) | Cod sursa (job #194065) | Cod sursa (job #1265669) | Cod sursa (job #2190483) | Cod sursa (job #398715)
Cod sursa(job #398715)
#include <cstdio>
#define in "aib.in"
#define out "aib.out"
#define NMAX 100001
int cauta(int val);
int suma(int x1);
void adauga(int poz,int val);
int N,M;
int arb[NMAX];
void citire()
{
int val,a,x1,x2,poz;
scanf("%d %d",&N,&M);
for(int i=1;i<=N;i++)
{
scanf("%d",&val);
adauga(i,val);
}
for(int i=1;i<=M;i++)
{
scanf("%d",&a);
if(a==0)
{
scanf("%d %d",&poz,&val);
adauga(poz,val);
}
else if(a==1)
{
scanf("%d %d",&x1,&x2);
printf("%d\n",suma(x2)-suma(x1-1));
}
else
{
scanf("%d",&val);
printf("%d\n",cauta(val));
}
}
}
int cauta(int val)
{
int P=1,poz=0,val2=val;
while(P<=N)
P<<=1;
P>>=1;
while(P)
{
if(arb[poz+P]<val)
{
poz+=P;
val-=arb[poz];
}
P>>=1;
}
if(arb[poz+1]==val2)
return poz+1;
return -1;
}
int suma(int x)
{
int P=1,suma=0,poz=0;
while(P<=x)
P<<=1;
P>>=1;
while(P)
{
if(poz+P<=x)
{
poz+=P;
suma+=arb[poz];
}
P>>=1;
}
return suma;
}
void adauga(int poz,int val)
{
int C = 0;
while ( poz <= N )
{
arb[poz] += val;
while ( !(poz & (1<<C)) ) C++;
poz += (1<<C);
C += 1;
}
}
int main()
{
freopen(in,"r",stdin);
freopen(out,"w",stdout);
citire();
return 0;
}