Pagini recente » Cod sursa (job #2359905) | Cod sursa (job #19177) | Cod sursa (job #1122333) | Cod sursa (job #2378301) | Cod sursa (job #522424)
Cod sursa(job #522424)
#include<iostream.h>
#include<fstream.h>
#define N 100001
long n,m,y,z,i,j,step,c[N],a[N],s;
int x;
long suma(long y,long z)
{s=0;
for(;y>0||z>0;y-=(y&(-y)),z-=(z&(-z)))
s+=c[z]-c[y];
return s;}
long pozitie(long step,long p)
{for(i=0;step!=0;step>>=1)
if(i+step<=n)
if(c[i+step]<p)
{i+=step;
p-=c[i];}
else
if(c[i+step]==p)
return i+step;
return -1;}
int main()
{fstream f1("aib.in",ios::in);
fstream f2("aib.out",ios::out);
f1>>n>>m;
for(step=1;step<=n;step<<=1);
step>>=1;
a[0]=0;
for(i=1;i<=n;i++)
{f1>>a[i];
a[i]+=a[i-1];
j=i-(i&(-i));
c[i]=a[i]-a[j];}
for(i=1;i<=m;i++)
{f1>>x>>y;
if(x==2)
f2<<pozitie(step,y)<<endl;
else
{f1>>z;
if(x==0)
{while(y<=n)
{c[y]+=z;
y+=(y&(-y));}}
else
f2<<suma(y-1,z)<<endl;}}
f1.close();
f2.close();
return 0;}