Cod sursa(job #210171)

Utilizator taloibogdanTaloi Bogdan Cristian taloibogdan Data 26 septembrie 2008 19:00:20
Problema Arbori de intervale Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include<stdio.h>
long stg,drp,x[400200],v,p,n,m,i,q,f,a,b;
void interogare(long nod,long st,long dr)
{long mij;
 if(stg<=st&&dr<=drp){if(m<x[nod])m=x[nod];return;}
 mij=(st+dr)/2;
 if(stg<=mij)interogare(2*nod,st,mij);
 if(mij<drp)interogare(2*nod+1,mij+1,dr);
}
void pune(long nod,long st,long dr)
{long mij;
 if(st==dr){x[nod]=v;return;}
 mij=(st+dr)/2;
 if(p<=mij)pune(2*nod,st,mij);
      else pune(2*nod+1,mij+1,dr);
 x[nod]=x[2*nod];
 if(x[2*nod+1]>x[nod])x[nod]=x[2*nod+1];
}
int main()
{
 freopen("arbint.in","r",stdin);
 freopen("arbint.out","w",stdout);
 scanf("%ld%ld",&n,&m);
 for(i=1;i<=m;++i){scanf("%ld",&q);p=i;v=q;pune(1,1,n);}
 for(i=1;i<=n;++i)
    {scanf("%ld%ld%ld",&f,&a,&b);
     if(f==0){m=0;stg=a;drp=b;interogare(1,1,n);printf("%ld\n",m);}
         else{p=a;v=b;pune(1,1,n);}}
 return 0;
}