Pagini recente » Cod sursa (job #2741667) | Cod sursa (job #2184310) | Cod sursa (job #1924089) | Cod sursa (job #1582196) | Cod sursa (job #1615778)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int N, M, v[15001], in[15001];
int main()
{
int i, op, a, b;
f>>N>>M;
for(i=1;i<=N;i++)
{
f>>v[i];
if(i!=1) in[i]=in[i-1]+v[i];
else in[i]=v[i];
}
for(i=1;i<=M;i++)
{
f>>op>>a>>b;
if(op)
if(a==1) g<<in[b]<<"\n";
else g<<in[b]-in[a-1]<<"\n";
else
{
v[a]-=b;
for(int j=a;j<=N;j++)
in[j]-=b;
}
}
return 0;
}