Pagini recente » Cod sursa (job #3190505) | Cod sursa (job #2383623) | Cod sursa (job #2814409) | Cod sursa (job #407062) | Cod sursa (job #1564180)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("datorii.in");
ofstream g("datorii.out");
int N;
long int M;
f>>N>>M;
int A[N+1];
int operatii[M+1][3];
for(int i=1; i<=N; i++)
f>>A[i];
for(int i=1; i<=M; i++)
for(int j=1; j<=3; j++)
f>>operatii[i][j];
for(int i=0; i<=M; i++)
{
if(operatii[i][1] == 0)
{
int T = operatii[i][2];
int V = operatii[i][3];
A[T] = A[T] - V;
}
else if(operatii[i][1] == 1)
{
long int suma = 0;
int P = operatii[i][2];
int Q = operatii[i][3];
for(int k=P; k<=Q; k++)
suma = suma + A[k];
g<<suma<<endl;
}
}
f.close();
g.close();
cout<<endl;
return 0;
}