Pagini recente » dot-com/2012/solutii/runda-1 | Rating Alexandru Plesescu (AlexandruPlesescu) | Cod sursa (job #2704916) | Cod sursa (job #2605287) | Cod sursa (job #517138)
Cod sursa(job #517138)
#include<fstream>
using namespace std;
int i,j,n,m,q,p,x,a[15001],s;
int main()
{
ifstream f("datorii.in");
ofstream g("datorii.out");
f>>n>>m;
a[0]=0;
for(i=1;i<=n;i++)
f>>a[i],a[i]+=a[i-1];
for(i=1;i<=m;i++)
{
f>>x>>q>>p;
if(x==0)
{
for(j=q;j<=n;j++)
a[j]-=p;
}
else
g<<a[p]-a[q-1]<<"\n";
}
return 0;
}