Pagini recente » Cod sursa (job #2746808) | Cod sursa (job #2466145) | Cod sursa (job #865882) | Cod sursa (job #1877244) | Cod sursa (job #948041)
Cod sursa(job #948041)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n, m, a[15010], i, val, x, y, t, c, s;
void Procesare(int p, int v){
int c=0;
while(p<=n)
{
a[p]+=v;
while(!(p & (1<<c)))
c++;
p+=(1<<c);
c++;
}
}
int Query(int p){
c=0;
s=0;
while(p>0)
{
s+=a[p];
while(!(p & (1<<c)))
c++;
p-=(1<<c);
c++;
}
return s;
}
int main(){
f>>n>>m;
for(i=1; i<=n; i++)
{
f>>val;
Procesare(i, val);
}
for(i=1; i<=m; i++)
{
f>>t;
f>>x>>y;
if(t==0)
Procesare(x, -y);
else
g<<Query(y)-Query(x-1)<<"\n";
}
return 0;
}