Cod sursa(job #935995)
Utilizator | Bonta vlad valentin VladMS | Data | 5 aprilie 2013 12:34:39 |
---|---|---|---|
Problema | Datorii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
#define NMAX 15001
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int i,j,n,m,a[NMAX],b[NMAX],cod,x,y;
int main()
{
fin>>n>>m;
for(i=1;i<=n;++i)
fin>>a[i];
for(i=1;i<=n;++i)
b[i]=b[i-1]+a[i];
for(i=1;i<=m;++i)
{
fin>>cod;
if(cod==1)
{
fin>>x>>y;
fout<<b[y]-b[x-1]<<'\n';
}
else
{
fin>>x>>y;
for(j=x;j<=n;++j)
b[j]=b[j]-y;
}
}
return 0;
}