Cod sursa(job #1308764)

Utilizator SorinmocanuFMI Sorin Mocanu Sorinmocanu Data 4 ianuarie 2015 17:17:33
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include <fstream>
using namespace std;

#define dim 100001
int n,m,maxarb[4*dim+66],start,finish,val,pos,maxim;
    ifstream f("arbint.in");
    ofstream g("arbint.out");

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

void update(int nod,int st,int dr)
{
     if (st==dr)
        {maxarb[nod]=val; return;}
     int mij=(st+dr)/2;
     if(pos<=mij) update(2*nod,st,mij);
        else update(2*nod+1,mij+1,dr);
     maxarb[nod]=max(maxarb[2*nod],maxarb[2*nod+1]);
}

void query(int nod,int st,int dr)
{
     if((start<=st)&&(dr<=finish))
        {if (maxim<maxarb[nod]) maxim=maxarb[nod]; return;}
     int mij=(st+dr)/2;
     if (start<=mij) query(2*nod,st,mij);
     if (mij<finish) query(2*nod+1,mij+1,dr);
}

int main()
{
    int x,a,b,i;


    f>>n>>m;
    for(i=1;i<=n;i++)
    {   f>>val; pos=i;
        update(1,1,n);}

    for(i=1;i<=m;i++)
    {   f>>x>>a>>b;
        if(x==0)
        {    maxim=0;
             start=a; finish=b;
             query(1,1,n);
             g<<maxim<<"\n";}
        else
        {   pos=a; val=b;
            update(1,1,n);}
    }
    f.close();
    g.close();
    return 0;
}