Cod sursa(job #856326)
| Utilizator | Data | 16 ianuarie 2013 12:03:54 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
int a[15001],n,m,o,p,q,i,s[15001],j;
int main()
{
f>>n>>m;
for(i=1;i<=n;++i) {f>>o; if(o) for(j=i;j<=n;++j) s[j]=s[j]+o;}
for(i=1;i<=m;++i)
{
f>>o>>p>>q;
if(o) g<<s[q]-s[p]+1<<'\n';
else for(j=p;j<=n;++j) s[j]-=q;
}
return 0;
}
