Pagini recente » Cod sursa (job #1942726) | Cod sursa (job #1349235) | Cod sursa (job #2858651)
#include <fstream>
#include <climits>
#include <iostream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n,m,v[4*100110],pb,a,b,start,finish,maxx,pos,val,nr;
int maxim(int a,int b)
{
if(a>b)return a;
return b;
}
void Interogare(int nod,int st,int dr)
{
int middle;
if(start<=st && dr<=finish)
{
if(maxx<v[nod]) maxx=v[nod];
return;
}
middle=(st+dr)/2;
if(start<=middle) Interogare(2*nod,st,middle);
if(middle<finish) Interogare(2*nod+1,middle+1,dr);
}
void Atribuire(int nod,int st,int dr)
{
int middle;
if(st==dr)
{
v[nod]=val;
return;
}
middle=(st+dr)/2;
if(pos<=middle)Atribuire(2*nod,st,middle);
else Atribuire(2*nod+1,middle+1,dr);
v[nod]=maxim(v[2*nod],v[2*nod+1]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
f>>nr;
pos=i,val=nr;
Atribuire(1,1,n);
}
for(int i=1;i<=m;i++)
{
f>>pb>>a>>b;
if(pb==0)
{
start=a;
finish=b;
maxx=-1;
Interogare(1,1,n);
g<<maxx<<'\n';
}
else
{
pos=a;
val=b;
Atribuire(1,1,n);
}
}
return 0;
}