Pagini recente » Cod sursa (job #234654) | Cod sursa (job #2115999) | Cod sursa (job #2626127) | Cod sursa (job #496603) | Cod sursa (job #2774274)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in ("datorii.in");
ofstream out("datorii.out");
int n;
int bit[100010];
void update (int i, int val)
{
while (i <= n)
{
bit[i] += val;
i += (i & -i);
}
}
int ps(int i)
{
int sum = 0;
while (i > 0)
{
sum += bit[i];
i -= (i & -i);
}
return sum;
}
int rangeSum(int i, int j){
return ps(j) - ps(i - 1);
}
int main ()
{
int m, i;
in >> n >> m;
for (i = 1; i <= n; i++)
{
int x;
in >> x;
update(i, x);
}
for (i = 1; i <= m; i++)
{
int q;
in >> q;
if (q == 0){
int t, v;
in >> t >> v;
update(t, -v);
}
else {
int p, r;
in >> p >> r;
out << rangeSum(p, r) << "\n";
}
}
}