Pagini recente » Cod sursa (job #1970960) | Cod sursa (job #2461194) | Cod sursa (job #909859) | Cod sursa (job #1272402) | Cod sursa (job #3165699)
#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const char nl = '\n';
const char sp = ' ';
const int inf = 0x3f3f3f3f;
const long long INF = 1000000000000000000;
const int mod = 1e9 + 7;
const char out[2][4]{ "NO", "YES" };
#define all(A) A.begin(), A.end()
using ll = long long;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
#define variableName(var) #var
#define __debug(var) cout << #var << " = " << var << '\n'
inline int rint(int a, int b) { return uniform_int_distribution<int>(a, b)(rng); }
const int nmax = 15000;
int n, m;
int t[nmax + 5]{ 0 };
void add(int i, int x) {
for (; i <= nmax; i += i & -i) {
t[i] += x;
}
}
int get(int i) {
int sum = 0;
for (; i > 0; i -= i & -i) {
sum += t[i];
}
return sum;
}
int get(int i, int j) {
return get(j) - get(i - 1);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
fin >> n >> m;
for (int i = 1; i <= n; ++i) {
int x;
fin >> x;
add(i, x);
}
for (int i = 1; i <= m; ++i) {
int t, a, b;
fin >> t >> a >> b;
if (t == 0) {
add(a, -b);
}
else {
fout << get(a, b) << nl;
}
}
}