Cod sursa(job #2420199)
Utilizator | Data | 11 mai 2019 09:55:51 | |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n,m,l,x,i1,j1,s,b[15005];
int main()
{f>>n>>m;
for(int i=1;i<=n;i++)
{f>>l;
b[i]=b[i-1]+l;
}
for(int i=1;i<=m;i++)
{
f>>x>>i1>>j1;
if(x==1)
g<<b[j1]-b[i1-1]<<'\n';
else
{
for(int j=i1;j<=n;j++)
b[j]=b[j]-j1;
}
}
return 0;
}