Pagini recente » Cod sursa (job #2392026) | Cod sursa (job #255254) | Cod sursa (job #2808124) | Cod sursa (job #378782) | Cod sursa (job #1707509)
#include <fstream>
#define InFile "datorii.in"
#define OutFile "datorii.out"
#define MAX 100001
using namespace std;
unsigned short int N;
unsigned int M;
unsigned int A[MAX];
bool type;
unsigned int T, V, P, Q;
unsigned int i, j;
unsigned int sum;
int main ()
{
ifstream fin (InFile);
ofstream fout (OutFile);
fin >> N >> M;
for (i=1; i<=N; i++)
fin >> A[i];
for (i=1; i<=M; i++)
{
fin >> type;
if (type == 0)
{
fin >> T >> V;
A[T] -= V;
}
else
{
fin >> P >> Q;
sum = 0;
for (j=P; j<=Q; j++)
sum += A[j];
fout << sum << '\n';
}
}
fin.close();
fout.close();
return 0;
}