Pagini recente » Cod sursa (job #688257) | Cod sursa (job #2179383) | Cod sursa (job #1818810) | Cod sursa (job #179210) | Cod sursa (job #2552482)
#include <fstream>
#define dim 15001
using namespace std;
int n, m, i, a, b, t;
int A[dim];
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
int LSB (int x)
{
return (x^(x-1))&x;
}
void update (int x, int d)
{
while (x<=n)
{
A[x]+=d;
x+=LSB(x);
}
}
int query (int x)
{
int sum =0;
while (x>0)
{
sum+=A[x];
x-=LSB(x);
}
return sum;
}
int main () {
fin>>n>>m;
for (i=1;i<=n;i++) {
fin>>a;
update(i, a);
}
for (i=1;i<=m;i++) {
fin>>t;
if (t==0) {
fin>>a>>b;
update(a, -b);
} else if (t==1){
fin>>a>>b;
fout<<query(b)-query(a-1)<<"\n";
}
}
return 0;
}