Cod sursa(job #1405147)
| Utilizator | Data | 28 martie 2015 21:45:42 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("datorii.in");
ofstream g ("datorii.out");
int n,m,i,j,a[15005],ind,val,p,q;
bool c;
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
{
f>>a[i];
a[i]+=a[i-1];
}
for (i=1;i<=m;i++)
{
f>>c;
if (c==true)
{
f>>p>>q;
g<<a[q]-a[p-1]<<'\n';
}
else
{
f>>ind>>val;
for (j=ind;j<=n;j++)
a[j]-=val;
}
}
return 0;
}
