Pagini recente » Cod sursa (job #677318) | Cod sursa (job #1329472) | Cod sursa (job #2709128) | Cod sursa (job #2282155) | Cod sursa (job #2401327)
#include <fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
const int N=1<<18;
int arb[N], a, b, poz, val;
int query(int p, int st, int dr)
{
if(a<=st && dr<=b) return arb[p];
int m=(st+dr)/2, m1=-1, m2=-1;
if(a<=m) m1=query(2*p, st, m);
if(b>m) m2=query(2*p+1, m+1, dr);
return max(m1, m2);
}
void update(int p, int st, int dr)
{
if(st==dr)
{
arb[p]=val;
return;
}
int m=(st+dr)/2;
if(poz<=m) update(2*p, st, m);
else update(2*p+1, m+1, dr);
arb[p]=max(arb[2*p], arb[2*p+1]);
}
int main()
{
int n, m;
in>>n>>m;
for(int i=1; i<=n; i++)
{
in>>val;
poz=i;
update(1, 1, n);
}
for(int i=1; i<=m; i++)
{
bool q;
in>>q;
if(!q)
{
in>>a>>b;
out<<query(1, 1, n)<<'\n';
}
else
{
in>>poz>>val;
update(1, 1, n);
}
}
return 0;
}