Pagini recente » Cod sursa (job #1902718) | Cod sursa (job #2287630) | Cod sursa (job #298961) | Cod sursa (job #2673851) | Cod sursa (job #3256402)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n,m,x,i,c,a,b,aib[15005];
void adun(int x,int val)
{
for(int i=x;i<=n;i+=i&(-i))
aib[i]+=val;
}
int suma(int x)
{
int s=0;
for(int i=x;i>=1;i-=i&(-i))
s+=aib[i];
return s;
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>x;
adun(i,x);
}
for(i=1;i<=m;i++)
{
f>>c>>a>>b;
if(c==0)
adun(a,-b);
else
g<<suma(b)-suma(a-1)<<'\n';
}
return 0;
}