Cod sursa(job #1246053)
| Utilizator | Data | 20 octombrie 2014 14:55:05 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
#define Nmax 15010
int bun[Nmax],sum[Nmax],n,m,i,j,a,b;
bool val;
void citire()
{
f>>n>>m;
for (int i=1;i<=n;++i)
{
f>>bun[i];
sum[i]=sum[i-1]+bun[i];
}
}
int main()
{
citire();
for (int i=1;i<=m;++i)
{
f>>val>>a>>b;
if (val==0)
{
bun[a]-=b;
for(j=a;j<=n;++j)
sum[j]-=b;
}
else
g<<sum[b]-sum[a]+bun[a]<<'\n';
}
return 0;
}
