Pagini recente » Cod sursa (job #2105461) | Cod sursa (job #2415528) | Cod sursa (job #1189621) | Cod sursa (job #974472) | Cod sursa (job #517767)
Cod sursa(job #517767)
#include <iostream>
#include <fstream>
#include <ctime>
using namespace std;
int n, m, a[15001], k, p, q, s[15001];
ifstream fin("datorii.in");
ofstream fout("datorii.out");
int main()
{
//clock_t beg=clock();
fin>>n>>m;
s[0]=0;
for (int i=1; i<=n; i++){
fin>>a[i];
s[i]=s[i-1]+a[i];
}
for (int i=1; i<=m; i++){
fin>>k>>p>>q;
if (k==0)
for (int j=p; j<=n; j++) s[j]-=q;
else
fout<<s[q]-s[p-1]<<endl;
}
//clock_t end=clock();
//cout<<float(end-beg)/CLOCKS_PER_SEC<<" ms";
}