Pagini recente » Profil padreati | Monitorul de evaluare | Istoria paginii utilizator/tudose.sanziana | Istoria paginii utilizator/beauty_in_the_sky | Cod sursa (job #2681567)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,m,i,v[15000],z,x,c,b,y,s;
ifstream f("datorii.in");
ofstream g("datorii.out");
f>>n>>m;
for(i=1; i<=n; i++)
f>>v[i];
while(m--)
{
f>>z;
s=0;
if(z==0)
{
f>>x>>y;
v[x]=v[x]-y;
}
else
{
f>>c>>b;
for(i=c; i<=b; i++)
s=s+v[i];
g<<s<<endl;
}
}
f.close();
g.close();
return 0;
}