Pagini recente » Cod sursa (job #2043400) | Cod sursa (job #2524960) | Cod sursa (job #822922) | Cod sursa (job #866955) | Cod sursa (job #2561474)
#include <fstream>
using namespace std;
ifstream fin ("datorii.in");
ofstream fout ("datorii.out");
int s[15005], c[15005];
int putere2k ( int x );
int main()
{
int n, m, i, p, x, y, r, v[15005];
fin >> n >> m;
for ( i = 1 ; i <= n ; i++ ) fin >> v[i], s[i] = s[i-1] + v[i];
for ( i = 1 ; i <= n ; i += 2 ) c[i] = v[i];
for ( i = 2 ; i <= n ; i += 2 ) c[i] = s[i] - s[i-putere2k(i)];
while ( m-- )
{
fin >> p >> x >> y;
if ( p == 0 ) for ( i = x ; i <= n ; i += putere2k ( i ) ) c[i] -= y;
else
{
r = 0;
for ( i = y ; i >= 1 ; i -= putere2k ( i ) ) r += c[i];
for ( i = x - 1 ; i >= 1 ; i -= putere2k ( i ) ) r -= c[i];
fout << r << '\n';
}
}
return 0;
}
int putere2k ( int x )
{
return x & ( x ^ ( x - 1 ) );
}