Cod sursa(job #2677158)
| Utilizator | Data | 25 noiembrie 2020 21:41:44 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream read("datorii.in");
ofstream show("datorii.out");
int n, m, a[15123], suma;
int T, V;
int P, Q;
int cod;
int main(){
read >> n >> m;
for(int i = 1; i <= n; i++)
read >> a[i];
for(int i = 1; i <= m; i++){
read >> cod;
if(cod == 0){
read >> T >> V;
a[T] = a[T] - V;
}
else{
suma = 0;
read >> P >> Q;
for(int j = P; j <= Q; j++){
suma += a[j];
}
show << suma << endl;
}
}
return 0;
}