Pagini recente » Cod sursa (job #1461941) | Cod sursa (job #1877397) | Istoria paginii runda/2014oni10/clasament | Cod sursa (job #1902224) | Cod sursa (job #633175)
Cod sursa(job #633175)
#include <fstream>
#define maxN 100001
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
unsigned n,m,c[maxN],i,x,a,y,z;
void modify(unsigned poz,unsigned x)
{
unsigned k=0;//nr de 0 terminale in repr binar
while(poz<=n)
{
c[poz]+=x;
while((poz & (1<<k))==0)
k++;
poz+=(1<<k);
k++;
}
}
unsigned sum(unsigned p) //suma subsecv 1..p
{
unsigned s=0,k=0;
while(p)
{
s+=c[p];
while((p & (1<<k))==0)
k++;
p-=(1<<k);
k++;
}
return s;
}
unsigned search(int x)
{
unsigned k,i;
for(k=0;k<n;k=(1<<k));
for(i=0;k;k=(k>>1))
{
if(i+k<=n)
{
if(x>=c[i+k])
{
i+=k;
x-=c[i];
if(!x)
return i;
}
}
}
return -1;
}
void citire()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>x;
modify(i,x);
}
for(i=1;i<=m;i++)
{
f>>x;
if(x==0)
{
f>>y>>z;
modify(y,z);
}
else
if(x==1)
{
f>>y>>z;
unsigned sum1,sum2;
sum1=sum(z);
sum2=sum(y-1);
g<<sum1-sum2<<'\n';
}
else
{
f>>a;
g<<search(a)<<'\n';
}
}
f.close();
g.close();
}
int main()
{
citire();
return 0;
}