Pagini recente » Cod sursa (job #33731) | Cod sursa (job #6263) | Monitorul de evaluare | Istoria paginii runda/training_day_3 | Cod sursa (job #2760894)
#include<cstdio>
using namespace std;
FILE*in=fopen("aib.in","r");
FILE*out=fopen("aib.out","w");
int n,m,c,a,b,aib[200005],i,po=1;
void up(int poz,int val)
{
int pt=poz;
while(pt<=po)
{
aib[pt]+=val;
pt+=pt&(-pt);
}
}
int sum(int poz)
{
int pt=poz;
int sol=0;
while(pt>0)
{
sol+=aib[pt];
pt-=pt&(-pt);
}
return sol;
}
int bs(int val)
{
int al=val;
int pas=po;
int ras=0;
int rras=-1;
while(pas>0)
{
if(al==aib[ras+pas])
{
rras=ras+pas;
}
if(al>aib[ras+pas])
{
ras+=pas;
al-=aib[ras];
}
pas/=2;
}
if(al==0)
{
return ras;
}
else
{
return rras;
}
}
int main()
{
fscanf(in,"%d%d",&n,&m);
while(po<n)
{
po*=2;
}
for(i=1;i<=n;i++)
{
fscanf(in,"%d",&a);
up(i,a);
}
for(i=1;i<=m;i++)
{
fscanf(in,"%d%d",&c,&a);
if(c==0)
{
fscanf(in,"%d",&b);
up(a,b);
}
else if(c==1)
{
fscanf(in,"%d",&b);
fprintf(out,"%d\n",sum(b)-sum(a-1));
}
else
{
fprintf(out,"%d\n",bs(a));
}
}
}