Pagini recente » Cod sursa (job #521459) | Cod sursa (job #1505411) | Cod sursa (job #679284) | Cod sursa (job #1330011) | Cod sursa (job #380272)
Cod sursa(job #380272)
#include<fstream.h>
ifstream fin("datorii.in");
ofstream fout("datorii.out");
long n,m,d,tp,qv,i,j,s,v[15001];
int sum(int p1,int p2)
{
long sa=0;
i=p1;
j=p2;
while(i<j)
{
sa=sa+v[i]+v[j];
i++;
j--;
}
if(i==j)
sa=sa+v[j];
return sa;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>v[i];
for(j=1;j<=m;j++)
{
fin>>d>>tp>>qv;
if(d==1)
fout<<sum(tp,qv)<<'\n';
else
v[tp]=v[tp]-qv;
}
return 0;
}