Cod sursa(job #1853299)
| Utilizator | Data | 21 ianuarie 2017 16:30:31 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | gym_emag_avansati_2016 | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n, m;
int a[15005];
void Update(int T, int V)
{
a[T]-=V;
}
int Suma(int P, int Q)
{
int s=0;
for(int i=P; i<=Q; i++)
{
s+=a[i];
}
return s;
}
int main()
{
f>>n>>m;
int o, x, y;
for(int i=1; i<=n; i++)
{
f>>a[i];
}
for(int i=1; i<=m; i++)
{
f>>o>>x>>y;
if(o==0) Update(x, y);
else g<<Suma(x, y)<<endl;
}
return 0;
}
