Pagini recente » Cod sursa (job #2596409) | Cod sursa (job #1758317) | Cod sursa (job #1044256) | Cod sursa (job #2625817) | Cod sursa (job #1512172)
#include <cstdio>
using namespace std;
#define MAXN 100004
int n,m,i,j,tip,x,y;
int v[MAXN];
int binar(int x)
{
return (x^(x-1)&x);
}
void adauga(int poz, int val)
{
for(int i=poz; i<=n; i+=binar(i))
v[i]+=val;
}
int sum(int poz)
{
int s=0;
for(int i=poz; i>=1; i-=binar(i))
s+=v[i];
return s;
}
int caut(int x)
{
int st=1, dr=n,mij;
while(st<=dr)
{
mij=(st+dr)/2;
if(x == sum(mij))
return mij;
if(x<sum(mij))
dr=mij-1;
else
st=mij+1;
}
return -1;
}
void afis()
{
for(int i=1; i<=n; i++)
printf("%d ",v[i]);
printf("\n");
}
int main()
{
freopen("aib.in","r",stdin);
freopen("aib.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1; i<=n; i++)
{
scanf("%d",&x);
adauga(i,x);
}
for(i=1; i<=m; i++)
{
scanf("%d",&tip);
if(!tip)
{
scanf("%d%d",&x,&y);
adauga(x,y);
}
if(tip==1)
{
scanf("%d%d",&x,&y);
printf("%d\n",sum(y)-sum(x-1));
}
if(tip==2)
{
scanf("%d",&x);
printf("%d\n",caut(x));
}
}
}