Pagini recente » Cod sursa (job #1550649) | Cod sursa (job #772926) | Cod sursa (job #493568) | Cod sursa (job #591798) | Cod sursa (job #2753152)
#include <fstream>
using namespace std;
const int N = 15000;
const int L = 16;
int aib[N], n;
void actualizare(int p, int val, int semn)
{
while (p <= n)
{
aib[p] += semn*val;
p += (p & (-p));
}
}
int interogare(int p)
{
int sum = 0;
while (p != 0)
{
sum += aib[p];
p -= (p & (-p));
}
return sum;
}
int main()
{
ifstream in("datorii.in");
ofstream out("datorii.out");
int m;
in >> n >> m;
for (int i = 1; i <= n; i++)
{
int x;
in >> x;
actualizare(i, x, 1);
}
for (int i = 0; i < m; i++)
{
int tip;
in >> tip;
if (tip == 0)
{
int t, v;
in >> t >> v;
actualizare(t, v, -1);
}
else
{
int p, q;
in >> p >> q;
out << interogare(q) - interogare(p - 1) << "\n";
}
}
in.close();
out.close();
return 0;
}