Pagini recente » Cod sursa (job #317173) | Cod sursa (job #2508106) | Cod sursa (job #2572118) | Cod sursa (job #1196047) | Cod sursa (job #1317925)
#include <iostream>
#include <cstdio>
#define DMAX 15005
//#define last2(k) (k^(k-1))&k
using namespace std;
int n, m, aib[DMAX], k;
int last2(int k)
{
return ((k^(k-1))&k);
}
void add(int pos, int val)
{
for(int i=pos; i<=n;i+=last2(i))
aib[i]+=val;
}
int sum(int pos)
{
int s=0;
for(int i=pos; i>0; i-=last2(i))
s+=aib[i];
return s;
}
int main()
{
freopen("datorii.in", "r", stdin);
freopen("datorii.out", "w", stdout);
scanf("%i %i", &n, &m);//cin>>n>>m;
int a,b;
for(int i=1;i<=n;i++)
{
scanf("%i", &k);//cin>>k;
add(i, k);
}
for(int i=1;i<=m;i++)
{
scanf("%i %i %i", &k, &a, &b);//cin>>k>>a>>b;
if(k==0)
add(a, -b);
if(k==1)
printf("%i\n", (sum(b)-sum(a-1)));//cout<<(sum(b)-sum(a-1))<<'\n';
}
return 0;
}