Pagini recente » Cod sursa (job #3185974) | Cod sursa (job #3250797) | Cod sursa (job #2724131) | Cod sursa (job #2800483) | Cod sursa (job #1262868)
#include <fstream>
using namespace std;
ifstream f("datorii.in");
ofstream g("datorii.out");
#define Nmax 15010
int i=1,j,n,binar,first,last;
long int m,S;
int a[Nmax];
int k;
int main()
{
f>>n>>m;
for( j=1; j<=n; j++)
f>>a[i++];
while (f>>binar>>first>>last)
{
if( binar == 1 )
{ S = 0;
for( j=first; j<=last; j++)
S = S + a[j];
g<<S<<'\n';
}
else
a[first]-=last;
}
return 0;
}