Cod sursa(job #2267113)
Utilizator | Ben Test BRIOI19 | Data | 23 octombrie 2018 11:56:18 |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#incnlude <fstream>
using namespace std;
int main() {
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m;
fin>>n>>m;
int arr[n+1];
for(int i=1;i<=n;i++){
fin>>arr[i];
}
while(m--){
int x;
cin>>x;
if(x == 0){
int t,v;
fin>>t>>v;
arr[t]-=v;
}
if(x==1){
long long res = 0;
int l,r;
fin>>l>>r;
for(int i=l;i<=r;i++){
res+=arr[i];
}
fout<<res<<endl;
}
}
}