Pagini recente » Cod sursa (job #670011) | Cod sursa (job #634187) | Cod sursa (job #145382) | Cod sursa (job #3206523) | Cod sursa (job #1989191)
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
int sumpar[15000];
int v[15001];
int main()
{
int n,m,t,x,i,j;
bool cer;
in>>n>>m;
int s=0;
for(i=1;i<=n;i++)
{
in>>v[i];
s+=v[i];
sumpar[i]=s;
}
for(i=1;i<=m;i++)
{
in>>cer>>t>>x;
if(cer==1)
out<<sumpar[x]-sumpar[t-1]<<'\n';
else
{
for(j=t;j<=n;j++)
sumpar[j]-=x;
}
}
return 0;
}