Pagini recente » Cod sursa (job #1322207) | Cod sursa (job #1094806) | Cod sursa (job #3160207) | Cod sursa (job #510321) | Cod sursa (job #1068901)
#include<fstream>
#include<cmath>
#define numaru 15000
#define numaru2 125
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int v[numaru],bb[numaru2],l,nrz,n,m;
void citirea()
{
f>>n>>m;
l=sqrt(n);
nrz=n/l;
if(n%l!=0)++nrz;
for(int i=0;i<n;++i)
{
f>>v[i];
bb[i/l]+=v[i];
}
}
void stats()
{
int i;
g<<"\nlistStats:\n";
for(i=0;i<n;g<<v[i]<<" ",++i);
g<<"\n";
for(i=0;i<nrz;g<<bb[i]<<" ",++i);
g<<"\nendStats\n";
}
void operatiunea0(int x,int y)
{
v[x]-=y;
bb[x/l]-=y;
}
void operatiunea1(int i,int j)
{
int k,sum=0;
for(k=i;k< ((i-1)/l+1)*l;++k)sum+=v[k];
for(k=(i-1)/l+1;k<(j+1)/l;++k)sum+=bb[k];
for(k=(j+1)/l*l;k<=j;++k)sum+=v[k];
g<<sum<<"\n";
}
void rezolvarea_operatiunilor()
{
int op,x,y;
for(;m;--m)
{
f>>op>>x>>y;
if(op==0)operatiunea0(x-1,y);
if(op==1)operatiunea1(x-1,y-1);
}
}
int main()
{
citirea();
rezolvarea_operatiunilor();
f.close();
g.close();
return 0;
}