Pagini recente » Cod sursa (job #1119538) | Cod sursa (job #1117136) | Cod sursa (job #2004399) | Cod sursa (job #46502) | Cod sursa (job #2716838)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int n,m,x,y;
int aib[100005];
void Update(int poz, int val)
{
while(poz<=n)
{
aib[poz]+=val;
poz = poz+(poz & (-poz));
}
}
int Query(int poz)
{
int s=0;
while(poz>0)
{
s += aib[poz];
poz = poz-(poz & (-poz));
}
return s;
}
int CautareBinara(int x)
{
int st=1, dr=n, sol=-1;
while(st<=dr)
{
int mij = (st+dr)/2;
int s=Query(mij);
if(x==s)
sol=mij, dr=mij-1;
else if(s>x)
dr=mij-1;
else
st=mij+1;
}
return sol;
}
int main()
{
fin>>n>>m;
for(int i=1; i<=n; i++)
{
fin>>x;
Update(i, x);
}
for(int i=1; i<=m; i++)
{
int tip;
fin>>tip;
if(tip==0)
{
fin>>x>>y;
Update(x,y);
}
else if(tip==1)
{
fin>>x>>y;
fout<<Query(y) - Query(x-1)<<"\n";
}
else if(tip==2)
{
fin>>x;
fout<<CautareBinara(x)<<"\n";
}
}
return 0;
}