Pagini recente » Cod sursa (job #369627) | Cod sursa (job #127214) | Cod sursa (job #2036057) | Cod sursa (job #274734) | Cod sursa (job #115935)
Cod sursa(job #115935)
#include<stdio.h>
#define N 15001
int n,m,a[N],bit,t,v;
void solve()
{
int i,s=0;
if(bit==1)
{
for(i=t;i<=v;i++)
s+=a[i];
printf("%d\n",s);
}
else
a[t]-=v;
}
void read_solve()
{
int i;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
for(i=1;i<=n;i++)
{
scanf("%d%d%d",&bit,&t,&v);
solve();
}
}
int main()
{
freopen("datorii.in","r",stdin);
freopen("datorii.out","w",stdout);
read_solve();
return 0;
}