Pagini recente » Cod sursa (job #1054196) | Cod sursa (job #2633991) | Cod sursa (job #1259948) | Cod sursa (job #2712930) | Cod sursa (job #2691131)
#include <fstream>
using namespace std;
const short NMAX=15000;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int v[NMAX+4],aib[NMAX+4];
int query(int pos)
{
int s=0;
while(pos>0)
{
s=s+aib[pos];
pos=pos&(pos-1);
}
return s;
}
void update(int pos,int val,int n)
{
while(pos<=n)
{
aib[pos]=aib[pos]+val;
pos=pos+(pos^(pos&(pos-1)));
}
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(NULL);
fout.tie(NULL);
int n,q,i,x,y,t;
fin>>n>>q;
for(i=1;i<=n;i++)
{
fin>>v[i];
update(i,v[i],n);
}
while(q--)
{
fin>>t>>x>>y;
if(t==0)
{
y=y*(-1);
update(x,y,n);
}
else
fout<<query(y)-query(x-1)<<"\n";
}
fin.close();
fout.close();
return 0;
}