Cod sursa(job #1973642)
| Utilizator | Data | 25 aprilie 2017 17:06:52 | |
|---|---|---|---|
| Problema | Datorii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream cin("datorii.in");
ofstream cout("datorii.out");
int v[15005],n,m,p,q,val,i,t,c,j;
long long vmax[15005];
int main()
{
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>v[i];
vmax[n]=v[n];
for(i=n-1;i>0;i--)
{
vmax[i]=vmax[i+1]+v[i];
}
for(i=1;i<=m;i++)
{
cin>>c;
if(c==0)
{
cin>>t>>val;
for(j=t;j>0;j--)
vmax[j]=vmax[j]-val;
}
else
{
cin>>p>>q;
cout<<vmax[p]-vmax[q+1]<<"\n";
}
}
return 0;
}
