Pagini recente » Cod sursa (job #260383) | Cod sursa (job #346349) | Cod sursa (job #2556813) | Cod sursa (job #1043416) | Cod sursa (job #1371494)
#include <fstream>
using namespace std;
ifstream is("aib.in");
ofstream os("aib.out");
int n, m, a[100001];
int type;
int position1, value, position2;
int logn = 1;
void Update(int pos, int val);
int Querry(int pos);
int main()
{
is >> n >> m;
int val;
for ( int i = 1; i <= n; ++i )
{
is >> value;
Update(i, value);
}
for ( logn; logn < n; logn <<= 1 );
for ( int i = 1; i <= m; ++i )
{
is >> type;
if ( !type )
{
is >> position1 >> value;
Update(position1, value);
}
if ( type == 1 )
{
is >> position1 >> position2;
os << Querry(position2) - Querry(position1 - 1) << '\n';
}
if ( type == 2 )
{
int pos;
is >> value;
for ( int byte = logn, pos = 0; byte; byte >>= 1 )
if ( pos + byte <= n && a[pos + byte] <= value )
{
pos += byte;
value -= a[pos];
if ( !value )
{
os << pos << '\n';
break;
}
}
}
}
is.close();
os.close();
return 0;
}
void Update(int pos, int val)
{
for ( int i = pos; i <= n; i += i & -i )
a[i] += val;
}
int Querry(int pos)
{
int s = 0;
for ( int i = pos ; i; i -= i & -i )
s += a[i];
return s;
}