Pagini recente » Cod sursa (job #3268428) | Cod sursa (job #3270477) | Cod sursa (job #3151963) | Cod sursa (job #2526004) | Cod sursa (job #1048290)
#include <fstream>
#define Nmax 15005
using namespace std;
int v[Nmax],N;
inline void Add(int p, int x)
{
int k;
while(p<=N)
{
v[p]+=x;
k=0;
while((p&(1<<k))==0)
k++;
p+=(1<<k);
}
}
inline int Query(int p)
{
int k,suma=0;
while(p>0)
{
suma+=v[p];
k=0;
while((p&(1<<k))==0)
k++;
p-=(1<<k);
}
return suma;
}
int main()
{
int M,sol,i,x,y,tip;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
fin>>N>>M;
for(i=1;i<=N;++i)
{
fin>>x;
Add(i,x);
}
while(M--)
{
fin>>tip>>x>>y;
if(tip==0)
Add(x,-y);
else
{
sol=Query(y)-Query(x-1);
fout<<sol<<"\n";
}
}
fin.close();
fout.close();
return 0;
}