Pagini recente » Cod sursa (job #1643997) | Cod sursa (job #446694) | Cod sursa (job #2607123) | Cod sursa (job #1810775) | Cod sursa (job #2567885)
#include <stdio.h>
#include <fstream>
#define MaxN 15000
using namespace std;
int suma(int p,int q,int a[]);
int main()
{
int a[MaxN],n,m,i,p,q,t,v,opt,srestanta;
ifstream f("datorii.in");
ofstream g("datorii.out");
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++){
f>>opt;
if(opt==0){
f>>t;
f>>v;
a[t]-=v;
}
else if(opt==1){
f>>p;
f>>q;
g<<suma(p,q,a)<<'\n';
}
}
f.close();
g.close();
return 0;
}
int suma(int p,int q,int a[])
{
int srestanta=0;
for(;p<=q;p++)
srestanta+=a[p];
return srestanta;
}