Pagini recente » Cod sursa (job #3252451) | Rating Buracu Stefan (Stefanel55) | Cod sursa (job #2229966) | Cod sursa (job #2521564) | Cod sursa (job #1645633)
#include <fstream>
using namespace std;
ifstream in("datorii.in");
ofstream out("datorii.out");
const int NMax = 15005;
int aib[NMax];
int n, m;
void UpdatePlus(int pos, int x)
{
for(int i = pos; i <= n; i += i&(-i))
{
aib[i] += x;
}
}
void UpdateMinus(int pos, int x)
{
for(int i = pos; i <= n; i += i&(-i))
{
aib[i] -= x;
}
}
int Sum(int pos)
{
int s = 0;
for(int i = pos; i > 0; i -= i&(-i))
{
s += aib[i];
}
return s;
}
void Read()
{
in>>n>>m;
for(int i = 1; i <= n; i++)
{
int x;
in>>x;
UpdatePlus(i,x);
}
}
void Solve_and_Print()
{
while(m--)
{
int x,y,opt;
in>>opt>>x>>y;
if(opt == 0) UpdateMinus(x,y);
else
{
out<<Sum(y)-Sum(x-1)<<'\n';
}
}
}
int main()
{
Read();
Solve_and_Print();
return 0;
}