Pagini recente » Cod sursa (job #3364298) | Cod sursa (job #3363848) | Cod sursa (job #3364292) | Cod sursa (job #3362140) | Cod sursa (job #3364169)
#include <fstream>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
#define int long long
int X[200005];
int SP[200005];
int AIB[200005];
int n, q;
int lsb(int x) {
return x&(-x);
}
int query(int x) {
int sum=0;
for (int i=x; i>0; i=i-(lsb(i))) {
sum=sum+AIB[i];
}
return sum;
}
void update(int x, int k) {
for (int i=x; i<=n; i=i+(lsb(i))) {
AIB[i]=AIB[i]+k;
}
}
signed main() {
cin>>n>>q;
for (int i=1; i<=n; i++) {
cin>>X[i];
update(i, X[i]);
}
for (int i=1; i<=q; i++) {
int op, a, b;
cin>>op>>a>>b;
if (op==0) {
update(a, -b);
X[a]=X[a]-b;
}
else cout<<query(b)-query(a-1)<<"\n";
}
}