Pagini recente » Cod sursa (job #1097659) | Cod sursa (job #687714) | Cod sursa (job #366317) | Cod sursa (job #1187070) | Cod sursa (job #2046503)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n,aib[15001],m,cif,a,b,x;
void adun(int x,int val)
{
int i;
for(i=x;i<=n;i+=i&(-i))
aib[i]+=val;
}
int suma(int x)
{
int s=0,i;
for(i=x;i>=1;i-=i&(-i))
s+=aib[i];
return s;
}
int main()
{
int i;
f>>n>>m;
for(i=1;i<=n;i++)
f>>x,adun(i,x);
for(i=1;i<=m;i++)
{
f>>cif>>a>>b;
if(cif==0) adun(a,-b);
else g<<suma(b)-suma(a-1)<<'\n';
}
return 0;
}