Pagini recente » Cod sursa (job #3330497) | Cod sursa (job #2204484) | Cod sursa (job #3326223) | Cod sursa (job #1307326) | Cod sursa (job #3344581)
#include <fstream>
std::ifstream f("datorii.in");
std::ofstream g("datorii.out");
int main(){
int N, M, a[15001], x;
int V, T, P, Q;
f >> N >> M;
for(int i = 1; i <= N; i++)
f >> a[i];
while(M){
f >> x;
if(x == 0){
f >> T >> V;
a[T] = a[T] - V;
}
else if(x == 1){
int s = 0;
f >> P >> Q;
for(int i = P; i <= Q; i++)
s = s + a[i];
g << s << std::endl;
}
M--;
}
return 0;
}