Pagini recente » Cod sursa (job #1092775) | Cod sursa (job #1397557) | Cod sursa (job #1920802) | Cod sursa (job #1185545) | Cod sursa (job #711938)
Cod sursa(job #711938)
#include<cstdio>
#define nmax 100001
#define MAX(a,b) a>b?a:b
int n,m,v[2*nmax],a,b,M,cod,x,y;
void Max(int rad, int st, int dr)
{
if(a<=st&&dr<=b)
{
if(v[rad]>M)
M=v[rad];
return;
}
int m=(st+dr)/2;
if(a<=m)
Max(2*rad,st,m);
if(m<b)
Max(2*rad+1,m+1,dr);
}
int main()
{
int i;
freopen("arbint.in","r",stdin);
freopen("arbint.out","w",stdout);
scanf("%d%d", &n, &m);
for(x=1;x<n;x*=2);
for(i=x;i<=2*n-1;i++)
scanf("%d", &v[i]);
for(i=2*n;i<=2*x-1;i++)
v[i]=0;
for(i=n;i<=x-1;i++)
scanf("%d", &v[i]);
for(i=n-1;i>=1;i--)
v[i]=MAX(v[2*i],v[2*i+1]);
for(i=1;i<=m;i++)
{
scanf("%d%d%d", &cod, &a, &b);
if(cod==0)
{
M=-1;
Max(1,1,n);
printf("%d\n", M);
}
else
{
int j;
y=1;
for(j=x;y!=a,j<=2*n-1;j++,y++);
for(j=n;y!=a;j++,y++);
y=j;
v[y]=b;
for(j=y/2;j>=1;j/=2)
v[j]=MAX(v[2*j],v[2*j+1]);
}
}
return 0;
}