Pagini recente » Cod sursa (job #2986520) | Cod sursa (job #2231146) | Cod sursa (job #1204983) | Cod sursa (job #2235658) | Cod sursa (job #3247804)
#include <fstream>
using namespace std;
int v[100001];
int n,m;
int query(int i){
int sum=0;
while(i>0){
sum+=v[i];
i-=(i&-i);
}
return sum;
}
void update(int i,int val){
while(i<=n){
v[i]+=val;
i+=(i&-i);
}
}
ifstream cin("datorii.in");
ofstream cout("datorii.out");
int main()
{
cin >> n >> m;
for(int i=1;i<=n;i++){
int x;
cin >> x;
update(i,x);
}
for(int i=0;i<m;i++){
int q,x,y;
cin >> q >> x >> y;
if(q==0)
update(x,-y);
else
cout << query(y)-query(x-1) << '\n';
}
return 0;
}