Pagini recente » Cod sursa (job #936615) | Cod sursa (job #1897608) | Cod sursa (job #780077) | Cod sursa (job #668180) | Cod sursa (job #2626354)
#include <fstream>
using namespace std;
ifstream f ("datorii.in");
ofstream g ("datorii.out");
int aib[100001], v[100001];
int getSum(int index) {
int s = 0;
while (index > 0) {
s += aib[index];
index -= index & (-index);
}
return s;
}
int Sum(int a, int b) {
return getSum(b) - getSum(a - 1);
}
void update(int index, int val,int n) {
while (index <= n) {
aib[index] += val;
index += index & (-index);
}
}
int main()
{
int n,m;
f>> n >> m;
for (int i = 1;i <= n;++i) {
f>> v[i];
update(i, v[i], n);
}
while (m--) {
int op;
f>> op;
if (op == 0) {
int x, y;
f>> x >> y;
update(x, -y, n);
}else if (op == 1) {
int a, b;
f>> a >> b;
g << Sum(a, b) << '\n';
}
}
return 0;
}