Pagini recente » Cod sursa (job #2703613) | Cod sursa (job #3031480) | Cod sursa (job #2216526) | Cod sursa (job #2494139) | Cod sursa (job #1512118)
#include <cstdio>
using namespace std;
#define MAXN 100004
int n,m,i,j,tip,x,y;
int v[MAXN];
int binar(int nr)
{
int p=1;
while( (nr&1) == 0 )
{
nr=nr>>1;
p=p<<1;
}
return p;
}
void adauga(int poz, int val)
{
for(int i=poz; i<=n; i+=binar(i))
v[i]+=val;
}
int sum(int st, int dr)
{
int s=0;
for(int i=dr; i>=st; i-=binar(i))
s+=v[i];
return s;
}
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(1,y)-sum(1,x-1));
}
if(tip==2)
{
scanf("%d",&x);
for(j=1; j<=n; j++)
if(v[j]==x)
{
printf("%d\n",j);
break;
}
if(j>n)
printf("0\n");
}
}
}