Pagini recente » Cod sursa (job #388010) | Cod sursa (job #564128) | Cod sursa (job #1453422) | Cod sursa (job #2838538) | Cod sursa (job #41239)
Cod sursa(job #41239)
// Problema datorii
#include <stdio.h>
#define MAX 15001
int A[MAX];
long b[MAX];
int main()
{
freopen( "datorii.in", "rt", stdin );
int n;
long m, s;
scanf( "%d %ld", &n, &m );
int i;
b[0] = 0;
for( i=1; i<=n; i++ )
{
scanf( "%d ", &A[i] );
b[i] = b[i-1]+A[i];
}
freopen( "datorii.out" , "wt", stdout );
int c, p, q;
while( m > 0 )
{
m--;
scanf( "%d %d %d", &c, &p, &q );
if( c == 0 ) for( i=p; i<=n; i++ ) b[i] -= q;
else
printf( "%ld\n", b[q]-b[p-1] );
}
fclose( stdin );
fclose( stdout );
return 0;
}