Pagini recente » Cod sursa (job #2434096) | Cod sursa (job #1370557) | Cod sursa (job #1235827) | Cod sursa (job #2069297) | Cod sursa (job #2557007)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int v[15001],N,M;
int DivImp(int st, int dr)
{
if(st==dr)
return v[st];
else{
int mij=(st+dr)/2;
int s1=DivImp(st,mij);
int s2=DivImp(mij+1,dr);
return s1+s2;
}
}
int main()
{
fin>>N>>M;
for(int i=1;i<=N;i++)
fin>>v[i];
for(int i=1;i<=M;i++)
{
int nr,T,P;
fin>>nr>>T>>P;
if(!nr){
for(int j=1;j<=N;j++)
if(T==j)
v[j]-=P;
}
else if(nr==1)
fout<<DivImp(T,P)<<'\n';
}
}