Pagini recente » Cod sursa (job #1083858) | Cod sursa (job #1806682) | Cod sursa (job #920300) | Cod sursa (job #2582081) | Cod sursa (job #3203275)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n, m, aib[15005];
int ub(int x)
{
return (x&(-x));
}
void add(int x, int val)
{
for(int i = x; i <= n; i += ub(i))
aib[i] += val;
}
int sum(int x)
{
int rez = 0;
for(int i = x; i >= 1; i -= ub(i))
rez += aib[i];
return rez;
}
int main()
{
f >> n >> m;
for(int i = 1; i <= n; i ++)
{
int x;
f >> x;
add(i, x);
}
for(int i = 1; i <= m; i ++)
{
int tip, x, y;
f >> tip >> x >> y;
if(tip == 0)
add(x, -y);
else
g << sum(y) - sum(x - 1) << '\n';
}
return 0;
}