Pagini recente » Cod sursa (job #1838323) | Cod sursa (job #2753857) | Cod sursa (job #2332075) | Cod sursa (job #1350281) | Cod sursa (job #1807582)
#include<fstream>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
long long a[15100], n, m, o, p, q;
int sum(int inc, int sf){
if(inc==sf) return a[inc];
else if(inc==sf-1) return a[inc]+a[sf];
else{
int mid=(inc+sf)/2;
return sum(inc, mid)+sum(mid+1, sf);
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1; i<=m; i++){
cin>>o>>p>>q;
if(o==0) a[p]-=q;
else if(o==1) cout<<sum(p,q)<<"\n";
}
return 0;
}