Cod sursa(job #517767)
| Utilizator | Data | 29 decembrie 2010 19:21:35 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#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";
}
