Pagini recente » Cod sursa (job #1500723) | Cod sursa (job #1964657) | Cod sursa (job #2538013) | Cod sursa (job #141783) | Cod sursa (job #2424676)
#include <bits/stdc++.h>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int n,m,c,x,y,a[100001];
void aduna(int p,int y)
{
for(;p<=n;p+=p&(-p))
a[p]+=y;
}
int suma(int p)
{
int s=0;
for(;p;p-=p&(-p))
s+=a[p];
return s;
}
int cauta(int a)
{
int lo=0,hi=n,mi;
while(hi-lo>1)
{
mi=(lo+hi)/2;
if(suma(mi)>=a)
hi=mi;
else
lo=mi;
}
if(suma(hi)!=a)lo=-1;
return hi;
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
f>>a[i];
for(int i=1;i<=m;i++)
{
f>>c>>x>>y;
if(c==0)
{
aduna(x,y);
}
else if(c==1)
{
g<<suma(y)-suma(x-1)<<'\n';
}
else
{
g<<cauta(x)<<'\n';
}
}
return 0;
}