Cod sursa(job #1330181)
| Utilizator | Data | 30 ianuarie 2015 14:44:26 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <iostream>
#include<fstream>
#define maxim 15001
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n, m, x, y,cod, a[maxim], v[maxim];
int main()
{ f>>n>>m;
for(int i=1; i<=n; i++) {f>>a[i]; v[i]=v[i-1]+a[i];}
for(int i=1; i<=m; i++)
{ f>>cod>>x>>y;
if(cod==1) g<<v[y]-v[x-1]<<"\n";
else {for(int j=x; j<=n; j++) v[j]=v[j]-y;}
}
return 0;
}
