Pagini recente » Cod sursa (job #886423) | Cod sursa (job #2872510) | Cod sursa (job #2536904) | Cod sursa (job #2809089) | Cod sursa (job #287458)
Cod sursa(job #287458)
#include<stdio.h>
long datorii[15001];
long n,m;
int main()
{
long i,j; int op,v1,v2;
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
scanf("%ld%ld",&n,&m);
for(i = 1; i <= n; i++)
{ scanf("%ld",datorii+i); datorii[i]+= datorii[i-1]; }
for(i = 1; i <= m; i++)
{
scanf("%d %d %d",&op,&v1,&v2);
if(!op)
{
for(j = v1; j <= n; j++) datorii[j] -= v2;
}
else printf("%ld\n",datorii[v2] - datorii[v1-1]);
}
fclose(stdin); fclose(stdout);
return 0;
}