Pagini recente » Cod sursa (job #114683) | Cod sursa (job #1896198) | Cod sursa (job #1819411) | Cod sursa (job #3137507) | Cod sursa (job #2781473)
#include <fstream>
using namespace std;
ifstream fin("datorii.in");
ofstream fout("datorii.out");
const int nmax=15000;
int v[nmax+1];
int query(int x){
int sol=0;
for(int i=x;i>0;i=(i&(i-1))){
sol+=v[i];
}
return sol;
}
int main(){
int n,m;
fin>>n>>m;
for(int i=1;i<=n;i++){
int x;
fin>>x;
for(int j=i;j<=n;j=2*j-(j&(j-1))){
v[j]+=x;
}
}
for(int im=1;im<=m;im++){
int x,a,b;
fin>>x>>a>>b;
if(x==0){
for(int i=a;i<=n;i=2*i-(i&(i-1))){
v[i]-=b;
}
}else{
fout<<query(b)-query(a-1)<<"\n";
}
}
return 0;
}