Cod sursa(job #2210400)
Utilizator | Data | 6 iunie 2018 16:44:54 | |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
#define NMAX 150001
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int N,M,a[NMAX];
int main()
{
fin>>N>>M;
for(int i = 1 ; i <= N; i++)
fin>>a[i];
while(M--)
{
int operatia,z,w;
fin>>operatia>>z>>w;
if(operatia==1)
{
int sum=0;
for(int i = z; i <= w; i++)
sum+=a[i];
fout<<sum<<'\n';
}
else
{
a[z]=a[z]-w;
}
}
return 0;
}