Pagini recente » Cod sursa (job #2955957) | Cod sursa (job #2414032) | Cod sursa (job #3144061) | Cod sursa (job #3170356) | Cod sursa (job #2665668)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int val[15002],aib[15002],n,i,nt,task,a,b;
void update(int k, int v)
{
int i;
for(i=k;i<=n;i+=i&(-i))
aib[i]+=v;
}
int suma (int k)
{
int s=0,i;
for(i=k;i>=1;i-=i&(-i))
s+=aib[i];
return s;
}
int main()
{
f>>n>>nt;
for(i=1;i<=n;i++)
{
f>>val[i];
update(i,val[i]);
}
for(i=1;i<=nt;i++)
{
f>>task>>a>>b;
if(task)
g<<suma(b)-suma(a-1)<<endl;
else
update(a,-b);
}
return 0;
}