Pagini recente » Cod sursa (job #1856689) | Cod sursa (job #2880153) | Cod sursa (job #2971517) | Cod sursa (job #2277315) | Cod sursa (job #378969)
Cod sursa(job #378969)
#include<fstream.h>
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m,d,tp,qv,i,j,v[15001];
int sum(int yu,int mn)
{
long s=0;
for(j=yu;j<=mn;j++)
s=s+v[j];
return s;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=m;i++)
{
fin>>d>>tp>>qv;
if(d==1)
fout<<sum(tp,qv)<<'\n';
else
v[tp]=v[tp]-qv;
}
return 0;
}