Pagini recente » Cod sursa (job #1417960) | Cod sursa (job #390728) | Cod sursa (job #2651019) | Cod sursa (job #1561688) | Cod sursa (job #2590572)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("datorii.in");
ofstream out ("datorii.out");
const int N=15001;
const int L=13;
int n,aib[N];
void actualizare (int p, int val)
{
while (p<=n)
{
aib[p]-=val;
p+=(p&(-p));
}
}
void construct (int p, int val)
{
while (p<=n)
{
aib[p]+=val;
p+=(p&(-p));
}
}
int interogare (int p)
{
int s=0;
while (p!=0)
{
s+=aib[p];
p-=(p&(-p));
}
return s;
}
int main()
{
int cod,x,y,m;
in>>n>>m;
for (int i=1;i<=n;i++)
{
in>>x;
construct (i,x);
}
for (int i=1;i<=m;i++)
{
in>>cod>>x>>y;
if (cod==0)
{
actualizare (x,y);
}
else
{
out<<interogare(y)-interogare(x-1)<<'\n';
}
}
return 0;
}