Pagini recente » Cod sursa (job #930631) | Cod sursa (job #2262612) | Cod sursa (job #2279787) | Cod sursa (job #2957587) | Cod sursa (job #2445001)
#include <fstream>
using namespace std;
int v[15001],aib[15001];
ifstream in ("aib.in");
ofstream out ("aib.out");
void update(int nod,int last,int value)
{
for(int i=nod;i<=last;i+=(i&(-i)))
aib[i]+=value;
}
int query (int nod)
{
int sum=0;
for (int i=nod;i;i-=(i&(-i)))
sum+=aib[i];
return sum;
}
int main()
{
int n,m;
in>>n>>m;
for (int i=1;i<=n;++i)
{
in>>v[i];
update(i,n,v[i]);
}
for (int i=1;i<=m;++i)
{
int caz;
in>>caz;
if (caz==0)
{
int t,v;
in>>t>>v;
update(t,n,-v);
}
else
{
int a,b;
in>>a>>b;
out<<query(b)-query(a-1)<<'\n';
}
}
return 0;
}