Pagini recente » Cod sursa (job #901228) | Cod sursa (job #686897) | Cod sursa (job #901237) | Cod sursa (job #1205172) | Cod sursa (job #2664297)
#include <fstream>
#define nrmax 10001
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,m;
int marb[nrmax*4+66];
int pos,val,maxim;
void update(int nod,int left,int right)
{
if (left==right)
{
marb[nod]=val;
return ;
}
int mij=(left+right)/2;
if (pos<=mij)
update(2*nod,left,mij);
else
update(2*nod+1,mij+1,right);
marb[nod]=max(marb[2*nod],marb[2*nod+1]);
}
int start,finish ;
void query(int nod,int left,int right)
{
if (start<=left && right<=finish)
{
if (maxim<marb[nod])
maxim=marb[nod];
return ;
}
int mij=left+right;
mij/=2;
if (start<=mij)
query(2*nod,left,mij);
if (mij<finish)
query(2*nod+1,mij+1,right);
}
int main()
{
fin>>n>>m;
for (int i=1; i<=n; i++)
{
int x;
fin>>x;
pos=i;
val=x;
update(1,1,n);
}
for (int i=1; i<=m; i++)
{
int op,a,b;
fin>>op>>a>>b;
if (op==0)
{
maxim=-1;
start=a;
finish=b;
query(1,1,n);
fout<<maxim<<'\n';
}
else
{
pos=a;
val=b;
update(1,1,n);
}
}
return 0;
}