Pagini recente » Cod sursa (job #1027633) | Cod sursa (job #2299925) | Cod sursa (job #791633) | Cod sursa (job #1758097) | Cod sursa (job #1605353)
#include <iostream>
#include <cstdio>
using namespace std;
int v[100500],n,m,a,b,type;
void actualizare(int index, int valoare)
{
while(index<=n)
{
v[index]+=valoare;
int p = ((index^(index - 1))+1)>>1;
index += p;
}
}
int suma(int index)
{
int s=0;
while(index)
{
s+=v[index];
index = index&(index-1);
}
return s;
}
int main()
{
freopen("aib.in","r",stdin);
freopen("aib.out","w",stdout);
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
actualizare(i,a);
}
for(int i=1;i<=m;i++)
{
scanf("%d",&type);
if(type == 0)
{
scanf("%d%d",&a,&b);
actualizare(a,b);
}
else if(type == 1)
{
scanf("%d%d",&a,&b);
printf("%d\n",suma(b)-suma(a-1));
}
else
{
scanf("%d",&a);
for(int i=1;i<=n;i++)
if(suma(i)==a)
{
printf("%d\n",i);
break;
}
}
}
return 0;
}