Cod sursa(job #1511761)

Utilizator ionut98Bejenariu Ionut Daniel ionut98 Data 27 octombrie 2015 08:49:44
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
#include<fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
#define dim 100001
int n,m;
int v[4*dim+66];
int start,finish,val,poz,mx;
void update(int,int,int);
void caut(int,int,int);
int main()
{
    int x,a,b;
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        poz=i;
        val=x;
        update(1,1,n);
    }
    for(int i=1;i<=m;i++)
    {
        f>>x>>a>>b;
        if(x==0)
        {
             mx=-1;
             start=a;
             finish=b;
             caut(1,1,n);
             g<<mx<<"\n";;
        }
        else
        {
            poz=a;
            val=b;
            update(1,1,n);
        }
    }
    return 0;
}

void update(int nod,int left,int right)
{
    if (left==right)
      v[nod]=val;
    else
    {
        int mij=(left+right)/2;
        if(poz<=mij)
          update(2*nod,left,mij);
        else
          update(2*nod+1,mij+1,right);
        v[nod]=max(v[2*nod],v[2*nod+1]);
    }
}
void caut(int nod,int left,int right)
{
    if(start<=left&&right<=finish)
      mx=max(mx,v[nod]);
    else
    {
        int mij=(left+right)/2;
        if(start<=mij)
          caut(2*nod,left,mij);
        if(mij<finish )
          caut(2*nod+1,mij+1,right);
    }
}