Pagini recente » Cod sursa (job #2522841) | Cod sursa (job #1062687) | Cod sursa (job #1179481) | Cod sursa (job #2984611) | Cod sursa (job #2851300)
#include <fstream>
using namespace std;
fstream cin("datorii.in",ios::in),cout("datorii.out",ios::out);
int n,v[15001],data[4*15000+1],m,x,y;
int c;
void build(int ind,int st,int dr){
if(st == dr){
data[ind] = v[st];
return;
}
int mij = (st+dr)/2;
build(2*ind,st,mij);
build(2*ind+1,mij+1,dr);
data[ind] = data[2*ind]+data[2*ind+1];
}
void up(int ind,int st,int dr){
if(st == dr){
data[ind] = v[st];
return;
}
int mij = (st+dr)/2;
if(x<=mij){
up(2*ind,st,mij);
}
else{
up(2*ind+1,mij+1,dr);
}
data[ind]=data[2*ind]+data[2*ind+1];
}
int query(int ind,int st,int dr){
if(x<=st && dr<=y){
return data[ind];
}
int mij = (st+dr)/2;
int ans=0;
if(x<=mij){
ans+=query(2*ind,st,mij);
}
if(mij<y){
ans+=query(2*ind+1,mij+1,dr);
}
return ans;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>v[i];
}
build(1,1,n);
for(;m;m--){
cin>>c>>x>>y;
if(c == 0){
v[x]-=y;
up(1,1,n);
}
else{
cout<<query(1,1,n)<<'\n';
}
}
return 0;
}