Cod sursa(job #716960)
| Utilizator | Data | 19 martie 2012 14:12:58 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<fstream>
using namespace std;
int n,m,A[15001],s;
ofstream g("datorii.out");
int main(void)
{
ifstream f("datorii.in");
f>>n>>m;
int i,a,b,c,j;
long long k;
for(i=1;i<=n;i++)
{
f>>A[i];
s+=A[i];
}
for(i=1;i<=m;i++)
{
f>>a>>b>>c;
if(a==0)
{
A[b]-=c;
s-=c;
}
else
{
k=0;
if(b+1-c<b-1+n-c)
for(;b<=c;b++)
k+=A[b];
else
{
for(j=1;j<b;j++)
k+=A[j];
for(j=c+1;j<=n;j++)
k+=A[j];
k=s-k;
}
g<<k<<'\n';
}
}
g.close();
return 0;
}
