Cod sursa(job #2300491)

Utilizator stefanut999Paul Colta stefanut999 Data 11 decembrie 2018 16:22:30
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.26 kb
#include <fstream>
std::ifstream cin("arbint.in");
std::ofstream cout("arbint.out");
#define maxim(a,b) a>b?a:b
#define mx 100050

int Maxarb[4*mx];
int pos,N,M,start,finish,maxi,val;

void update(int, int, int);
void query(int, int,int);

int main()
{
    int tip;
    cin>>N>>M;
    for(int i=1; i<=N; i++)
    {
        cin>>val;
        pos=i;
        update(1,1,N);
    }
    for(int i=1; i<=M; i++)
    {
        cin>>tip>>start>>finish;
        if(!tip)
        {
            maxi=-1;
            query(1,1,N);
            cout<<maxi<<'\n';
        }
        else
        {
            pos=start;
            val=finish;
            update(1,1,N);
        }
    }
    return 0;
}

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

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