Cod sursa(job #2238094)
| Utilizator | Data | 4 septembrie 2018 16:57:31 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int N = 0, M = 0;
int main()
{
fin >> N >> M;
int tab[N+2];
tab[0] = 0;
for(int i = 1; i <= N; i++)
{
fin >> tab[i];
tab[i] += tab[i - 1];
}
int mod, a, b;
for(int i = 0; i < M; i++)
{
fin >> mod >> a >> b;
if(mod)
{
fout << (tab[b] - tab[a - 1]) << "\n";
}
else
{
for(int j = a; j <= N; j++)
tab[j] -= b;
}
}
return 0;
}
