Pagini recente » Cod sursa (job #3242401) | Cod sursa (job #401634) | Cod sursa (job #409004) | Cod sursa (job #1136951) | Cod sursa (job #352194)
Cod sursa(job #352194)
#include<iostream.h>
long n,m;
int a[15000],b[15000];
struct op{int tip,t,v;} j;
int main()
{
int i;
long k;
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
cin>>n>>m;
cin>>a[0];
b[0]=a[0];
for(i=1;i<n;i++)
{
cin>>a[i];
b[i]=b[i-1]+a[i];
}
for(k=0;k<=m;k++)
{
cin>>j.tip;
cin>>j.t;
cin>>j.v;
if(!j.tip)
for(;j.t<n;j.t++)
a[j.t]-= j.v;
else
cout<<a[j.v+1]-a[j.t];
}
return 0;
}