Pagini recente » Cod sursa (job #927379) | Cod sursa (job #499308) | Cod sursa (job #698415) | Cod sursa (job #3189994) | Cod sursa (job #3273308)
#include <fstream>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
long long aib[15001];
long long ar(long long i)
{
long long r=0;
while(i>0)
{
r+=aib[i];
i-=-i&i;
}
return r;
}
int main()
{
long long n,m,a,b,c,j;
cin>>n>>m;
for(long long i=1;i<=n;i++)
{
cin>>a;
j=i;
while(j<=n)
{
aib[j]+=a;
j+=-j&j;
}
}
while(m--)
{
cin>>a>>b>>c;
if(a==0)
{
j=b;
while(j<=n)
{
aib[j]-=c;
j+=-j&j;
}
}
if(a==1)
cout<<ar(c)-ar(b-1)<<'\n';
}
return 0;
}