Pagini recente » Cod sursa (job #1496009) | Cod sursa (job #2241454) | Cod sursa (job #2800839) | Cod sursa (job #3222484) | Cod sursa (job #1915951)
#include <iostream>
#include <fstream>
using namespace std;
int n, m, preturi[15001], z, t, zd1, zd2, pret;
short cerinta;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int main()
{
fin>>n>>m;
for(int i=1;i<=n;i++)
{
fin>>pret;
preturi[i]=preturi[i-1]+pret;
}
for(int i=1;i<=m;i++)
{
fin>>cerinta;
if(cerinta==0)
{
fin>>z>>t;
for(int j=z;j<=n;j++)
{
preturi[j]-=t;
}
}
else
{
fin>>zd1>>zd2;
fout<<preturi[zd2]-preturi[zd1-1]<<'\n';
}
}
return 0;
}