Pagini recente » Cod sursa (job #341524) | Cod sursa (job #616975) | Cod sursa (job #1514409) | Cod sursa (job #296321) | Cod sursa (job #1780663)
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
const string fis = "arbint";
ifstream is(fis + ".in");
ofstream os(fis + ".out");
using VI = vector<int>;
using VS = vector<short>;
using VVI = vector<VI>;
int n, N, m;
int tip, a, b;
VI arb;
int main()
{
is >> n >> m;
for ( N = 1; N < n; N <<= 1 );
arb = VI(2 * N);
for ( int i = 0; i < n; ++i )
is >> arb[N + i];
for ( int i = N - 1; i; --i )
arb[i] = max(arb[2 * i], arb[2 * i + 1]);
while ( m-- )
{
is >> tip >> a >> b;
if ( tip )
{
arb[N + a - 1] = b;
for ( int i = ( N + a - 1 ) / 2; i; i /= 2 )
arb[i] = max(arb[2 * i], arb[2 * i + 1]);
}
else
{
int s = 0;
a += N - 1;
b += N - 1;
while ( a <= b )
{
s = max(s, max(arb[a], arb[b]));
a = ( a + 1 ) / 2;
b = ( b - 1 ) / 2;
}
os << s << "\n";
}
}
is.close();
os.close();
return 0;
}