Pagini recente » Cod sursa (job #670684) | Cod sursa (job #2622985) | Cod sursa (job #2794862) | Cod sursa (job #3120501) | Cod sursa (job #1077257)
#include<fstream>
#include<cmath>
using namespace std;
int v[15001],bb[125];
int main()
{
ifstream f("datorii.in");
ofstream g("datorii.out");
int n,i,j,k,sum,m,l,nrz,op,edd;
f>>n>>m;
l=sqrt(n+1);
nrz=n/l;
if(n%l!=0)++nrz;
for(i=0;i<n;++i)
{
f>>v[i];
bb[i/l]+=v[i];
}
for(;m;--m)
{
f>>op>>i>>j;
if(op==0)
{
v[--i]-=j;
bb[i/l]-=j;
}
else
{
--i;
--j;
sum=0;
if(i/l==j/l)
{
if( i%l==0 && ((j+1)%l==0 || j==n-1))sum+=bb[i/l];
else for(k=i;k<=j;++k)sum+=v[k];
}
else
{
if(i%l==0) sum+=bb[i/l];
else for(k=i,edd=(i/l+1)*l-1;k<=edd;++k)sum+=v[k];
for(k=i/l+1,edd=j/l-1;k<=edd;++k)sum+=bb[k];
if((j+1)%l==0 || j==n-1)sum+=bb[j/l];
else for(k=j/l*l;k<=j;++k)sum+=v[k];
}
g<<sum<<"\n";
}
}
f.close();
g.close();
return 0;
}