Pagini recente » Cod sursa (job #202735) | Cod sursa (job #49549) | Cod sursa (job #2443248) | Cod sursa (job #1153634) | Cod sursa (job #2959562)
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int n, m, x, aib[15005], c, a, b;
void Add(int x, int val)
{
for(int i = x; i <= n; i += i & -i)
aib[i] += val;
}
int sum(int x) // suma A[1] + ... + A[x]
{
int s = 0;
for(int i = x; i >= 1; i -= i & -i)
s += aib[i];
return s;
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; ++i) // O(n * log2(n))
{
fin >> x;
Add(i, x);
}
for(int i = 1; i <= m; ++i) // O(Q * log2(n)))
{
fin >> c >> a >> b;
if (c == 0)
Add(a, -b);
else if(c == 1)
fout << sum(b) - sum(a - 1) << '\n';
}
return 0;
}