Pagini recente » Cod sursa (job #2772107) | Cod sursa (job #842402) | Cod sursa (job #313521) | Cod sursa (job #2695810) | Cod sursa (job #2638185)
//#include <iostream>
#include <fstream>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
const int NMAX=15099;
int main(){
int n,m;
int a[NMAX];
cin >>n>>m;
for(int i=1;i<=n;i++)
cin >>a[i];
for(int i=1;i<=m;i++){
int q;
cin >>q;
switch(q){
case 0:{
int z,x;
cin >>x>>z;
a[x]-=z;
break;
}
case 1:{
int sum=0,o,p;
cin >>p>>o;
for(int g=p;g<=o;g++){
sum+=a[g];
}
cout <<sum<<"\n";
break;
}
}
}
return 0;
}