Pagini recente » Cod sursa (job #1470019) | Cod sursa (job #2176899) | Cod sursa (job #2974153) | Cod sursa (job #2548303) | Cod sursa (job #306936)
Cod sursa(job #306936)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
using namespace std;
int main()
{
int b[15001],n,m,i,x,y,c,j;
f>>n>>m;
b[0]=0;
for (i=1;i<=n;i++)
{
f>>b[i];
b[i]=b[i]+b[i-1];
}
for (i=1;i<=m;i++)
{
f>>c>>x>>y;
if (c==0)
{
for (j=x;j<=n;j++)
b[j]=b[j]-y;
}
else
g<<b[y]-b[x-1]<<"\n";
}
f.close();
g.close();
return 0;
}