Cod sursa(job #765358)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 7 iulie 2012 12:58:47
Problema Arbori de intervale Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<cstdio>
int n,m,y,z,h[400005],x;

int A(int n,int s,int d)
{if(y<=s&&d<=z)
     return h[n];
int m=(s+d)/2;
if(y<=m)
     return A(2*n,s,m);
if(z>m)
     return A(2*n+1,m+1,d);
return 0;}

void B(int n,int s,int d)
{if(s==d)
     {h[n]=z;
     return;}
if(y<=(s+d)/2)
     B(2*n,s,(s+d)/2);
else
     B(2*n+1,(s+d)/2+1,d);
h[n]=h[2*n]<h[2*n+1]?h[2*n+1]:h[2*n];}

int main()
{freopen("arbint.in","r",stdin);
freopen("arbint.out","w",stdout);
scanf("%d%d",&n,&m);
for(y=1;y<=n;y++)
     scanf("%d",&z),B(1,1,n);
while(m--)
     {scanf("%d%d%d",&x,&y,&z);
     if(!x)
           printf("%d\n",A(1,1,n));
     else
           B(1,1,n);}
return 0;}