Pagini recente » Cod sursa (job #2421044) | Cod sursa (job #2005385) | Cod sursa (job #2107952) | Cod sursa (job #2779944) | Cod sursa (job #1645752)
#include <fstream>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int x[100005],aib[100005];
int n,m;
void update(int p,int v)
{
for(int i=p;i<=n;i+=i&(-i))
aib[i]+=v;
}
int query(int p)
{
int s=0;
for(int i=p;i>0;i-=i&(-i))
s+=aib[i];
return s;
}
int bin (int val)
{ int L=1,R=n;
while(L<=R)
{
int mid=(L+R)/2;
int s=query(mid);
if(s==val)
return mid;
else
{
if(s>val)
{
R=mid-1;
}
else
{
L=mid+1;
}
}
}
int mid=(L+R)/2;
int s=query(mid);
if(s==val)
return mid;
else
return -1;
}
int bin2(int val)
{
int i, step;
for ( step = 1; step < n; step <<= 1 );
for( i = 0; step; step >>= 1 )
{
if( i + step <= n)
{
if( val >= aib[i+step] )
{
i += step, val -= aib[i];
if ( !val ) return i;
}
}
}
return -1;
}
void citire()
{ fin>>n>>m;
int o,p,v;
for(int i=1;i<=n;i++)
{fin>>x[i];
int z=-i;
for(int j=0;j<(i&(-i));j++)
aib[i]=aib[i]+x[i-j];
}
for(int i=1;i<=m;i++)
{
fin>>o;
if(o==0)
{
fin>>p>>v;
update(p,v);
}
else
{
if(o==1)
{
fin>>p>>v;
fout<<query(v)-query(p-1)<<endl;
}
else
{
fin>>v;
fout<<bin2(v)<<endl;
}
}
}
}
int main()
{
citire();
}