Pagini recente » Cod sursa (job #1313998) | Cod sursa (job #645779) | Cod sursa (job #151688) | Cod sursa (job #733157) | Cod sursa (job #1639903)
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int n,i,j,m,x,y,a,b,k,v[100005];
void update(int poz, int val)
{
int i;
for(i = poz; i <= n; i+=(-i)&i)
v[i] += val;
}
int suma(int poz)
{
int i;
b = 0;
for(i = poz; i>0 ; i-=(-i)&i)
b += v[i];
return b;
}
int findd(int val)
{
int i,step;
for(step=1; step<=n; step<<=1);
for(i = 0; step; step>>=1)
{
if(i + step <= n )
if(v[i + step] <= val)
i += step,val-=v[i];
if(val == 0)
return i;
}
return -1;
}
int main()
{
fin >> n >> m;
for(i = 1; i <= n; i++)
fin >> a,update(i, a);
for(i = 1 ;i <= m; i++)
{
int p;
fin >> p;
if(p == 0)
fin >> a >> b,update(a,b);
else
if(p == 1)
fin >> a >> b,fout<<suma(b) - suma(a-1)<<"\n";
else
fin>>a,fout<<findd(a)<<'\n';
}
return 0;
}