Pagini recente » Cod sursa (job #1979090) | Cod sursa (job #2003257) | Cod sursa (job #1054479) | Cod sursa (job #1114288) | Cod sursa (job #1162468)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int n,m,a[15002],x,y,t,v,sum;
bool bin;
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++){ f>>a[i];a[i]+=a[i-1];}
for(int i=1;i<=m;i++){
f>>bin;
if(bin==true){ sum=0;f>>x>>y;
//for(int j=x;j<=y;j++) sum+=a[j];
g<<a[y]-a[x-1]<<endl;
}else{
f>>t>>v;
for(int j=t;j<=n;j++)a[j]-=v;
}
}
f.close();g.close();
return 0;
}