Pagini recente » Cod sursa (job #2129249) | Cod sursa (job #424858) | Cod sursa (job #2077197) | Cod sursa (job #1208945) | Cod sursa (job #484450)
Cod sursa(job #484450)
#include<algorithm>
#include<stdio.h>
#define Nmax 101010
using namespace std;
int AIB[Nmax],v[Nmax],M,x,y,z;
int N,num;
inline int zeros(int x)
{
return ((x ^ (x - 1)) & x );
}
inline void Add(int x, int q)
{
int i;
for (i = x; i <= N; i += zeros(i))
AIB[i]+=q;
}
inline int comp(int x)
{
int i, ret = 0;
for (i = x; i > 0; i -= zeros(i))
ret +=AIB[i];
return ret;
}
int main()
{
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
scanf("%d%d",&N,&M);
for(int i=1;i<=N;++i)
{
scanf("%d",&v[i]);
Add(i,v[i]);
}
for(int i=1;i<=M;++i)
{
scanf("%d%d%d",&x,&y,&z);
if(x==0)
{
Add(y,-z);
}
if(x==1)
{
printf("%d\n",comp(z)-comp(y-1));
}
}
}