Pagini recente » Cod sursa (job #1351622) | Cod sursa (job #689124) | Cod sursa (job #2250603) | Cod sursa (job #1026038) | Cod sursa (job #583748)
Cod sursa(job #583748)
#include <fstream>
#include <iostream>
using namespace std;
int n,m;
inline int bit(int x)
{
return ((x&(x-1))^x);
}
int aib[15003];
void update(int x,int y)
{
int i;
for(i=x;i<=n;i+=bit(i))
aib[i]+=y;
}
int querry(int x)
{
int sum=0,i;
for(i=x;i>0;i-=bit(i))
sum+=aib[i];
return sum;
}
int main()
{
int i,op,x,y;
ifstream in("datorii.in");
ofstream out("datorii.out");
in>>n>>m;
for(i=1;i<=n;i++)
{
in>>x;
if(x!=0)
update(i,x);
}
for(i=0;i<m;i++)
{
in>>op>>x>>y;
if(op==1)
out<<querry(y)-querry(x-1)<<'\n';
else update(x,-y);
}
in.close(),out.close();
return 0;
}