Cod sursa(job #331794)

Utilizator IoannaPandele Ioana Ioanna Data 15 iulie 2009 12:56:58
Problema Arbori de intervale Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.12 kb
#include<stdio.h>
#define mmax 100005
#define nmax 200010
long n,a,b,o,m;
long v[mmax],poz[mmax],t[nmax];

long max(long a,long b)
{
if (a>b)
    return a;
return b;
}

void update(long k,long st,long dr,long a,long b)
{
long mij;
if (st==dr)
   {
    t[k]=b;
    return;
   }
mij=(st+dr)/2;
if (a<=mij)
    update(2*k,st,mij,a,b);
else update(2*k+1,mij+1,dr,a,b);
t[k]=max(t[2*k],t[2*k+1]);
}

void read()
{
scanf("%ld%ld",&n,&m);
long i;
for (i=1;i<=n;i++)
    {
     scanf("%ld",&v[i]);
     update(1,1,n,i,v[i]);
     }
}


long interv(long k,long st,long dr,long a,long b)
{
long mij,fs=0,fd=0;
if (a<=st && b>=dr)
    return t[k];
mij=(st+dr)/2;
if (a<=mij)
    fs=interv(2*k,st,mij,a,b);
if (b>mij)
    fd=interv(2*k+1,mij+1,dr,a,b);
return max(fs,fd);
}

int main()
{
freopen("arbint.in","r",stdin);
freopen("arbint.out","w",stdout);
read();
long i;
for (i=1;i<=m;i++)
     {
      scanf("%ld%ld%ld",&o,&a,&b);
      if (!o)
         {
          printf("%ld\n",interv(1,1,n,a,b));
         }
      else {
            update(1,1,n,a,b);
           }
     }
return 0;
}