Pagini recente » Cod sursa (job #2451906) | Cod sursa (job #3237198) | Cod sursa (job #3233889) | Cod sursa (job #3239593) | Cod sursa (job #1317896)
#include <iostream>
#include <cstdio>
#define DMAX 15001
using namespace std;
int n, m, aib[DMAX], k;
int last2(int k)
{
return ((k^(k-1))+1)>>1;
}
void add(int pos, int val)
{
while(pos<=n)
{
aib[pos]+=val;
pos+=last2(pos);
}
}
int sum(int pos)
{
int s=0;
while(pos>0)
{
s+=aib[pos];
pos-=last2(pos);
}
return s;
}
int main()
{
freopen("datorii.in", "r", stdin);
freopen("datorii.out", "w", stdout);
cin>>n>>m;
int a,b;
for(int i=1;i<=n;i++)
{
cin>>k;
add(i, k);
}
for(int i=1;i<=m;i++)
{
cin>>k>>a>>b;
if(k==0)
add(a, -b);
if(k==1)
cout<<(sum(b)-sum(a-1))<<'\n';
}
return 0;
}