Pagini recente » Cod sursa (job #623982) | Cod sursa (job #1070111) | Cod sursa (job #265432) | Cod sursa (job #433696) | Cod sursa (job #3214810)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int N,M;
int aib[100005];
int v[100005];
int c;
int Query(int V){
int sum=0;
for(int i=V;i>=0;i-=(i&(-i))){
if(i==0) break;
sum+=aib[i];
}
return sum;
}
void Update(int P,int V){
for(int i=P;i<=N;i+=(i&(-i)))
aib[i]+=V;
}
int Sum(int a, int b){
return Query(b)-Query(a-1);
}
int main(){
fin>>N>>M;
for(int i=1;i<=N;i++){
fin>>v[i];
Update(i,v[i]);
}
for (int i = 1; i <= M; i++){
fin>>c;
//cout<<c;
if(c==0){
int a,b;
fin>>a>>b;
Update(a,-b);
}
if(c==1){
int a,b;
fin>>a>>b;
fout<<Sum(a,b)<<'\n';
}
}
}