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