Pagini recente » Cod sursa (job #1090097) | Cod sursa (job #1257699) | Cod sursa (job #1332954) | Cod sursa (job #2935975) | Cod sursa (job #925295)
Cod sursa(job #925295)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int A[15001],o,N,M,T,V,P,Q,i,j,s=0;
freopen ("datorii.in" , "r+",stdin);
freopen ("datorii.out" , "w+",stdout);
scanf("%d",&N);scanf("%d",&M);
for(i=1;i<=N;i++)
{
scanf("%d",&A[i]);
}
for(i=1;i<=M;i++)
{
scanf("%d",&o);
if(o==0)
{
scanf("%d",&T);scanf("%d",&V);
A[T]=A[T]-V;
}
else
{
scanf("%d",&P);scanf("%d",&Q);
for(j=P;j<=Q;j++)
{
s=s+A[j];
}
printf("%d\n",s);
s=0;
}
}
return 0;
}