Pagini recente » Cod sursa (job #1602527) | Cod sursa (job #2193384) | Cod sursa (job #1951295) | Cod sursa (job #2020555) | Cod sursa (job #330345)
Cod sursa(job #330345)
#include <stdio.h>
#define N 15050
int n,m;
int s[N];
void read()
{
scanf("%d %d\n",&n,&m);
int i,x;
for (i=1; i<=n; i++)
{
scanf("%d",&x);
s[i]=s[i-1]+x;
}
}
void solve()
{
int i,j,x,y,z;
for (i=1; i<=m; i++)
{
scanf("%d%d%d",&x,&y,&z);
if (x==1)
printf("%d\n",s[z]-s[y-1]);
else
for (j=y; j<=n; j++)
s[j]-=z;
}
}
int main()
{
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
read();
solve();
return 0;
}