Pagini recente » Cod sursa (job #3125457) | Cod sursa (job #237109) | Cod sursa (job #2463810) | Cod sursa (job #3142388) | Cod sursa (job #2420996)
#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 sum=suma(1);
int hi,lo,mid;
while(lo<=hi)
{
mid=(lo+hi)/2;
if(sum>suma(mid))
lo=mid-1;
else if(sum<suma(mid))
hi=mid-1;
else
return mid;
}
return -1;
}
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;
}