Pagini recente » Cod sursa (job #3269472) | Cod sursa (job #1636857) | Cod sursa (job #3181045) | Cod sursa (job #3184451) | Cod sursa (job #3280389)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n,m,t,v,p,q,a[15000];
bool caz;
long long s;
int main()
{
fin>>n>>m;
for(int i=0;i<n;++i)
fin>>a[i];
while(m)
{
fin>>caz;
switch(caz)
{
case 0:
{
fin>>t>>v;
a[t-1]=a[t-1]-v;
break;
}
case 1:
{
s=0;
fin>>p>>q;
for(int i=p-1;i<=q-1;++i)
s+=a[i];
fout<<s<<"\n";
break;
}
}
m--;
}
}