Cod sursa(job #2401310)

Utilizator vladstanciuVlad Stanciu vladstanciu Data 9 aprilie 2019 16:39:15
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include <iostream>
#include <fstream>

using namespace std;

ifstream in("arbint.in");
ofstream out("arbint.out");

const int N=1<<18;
int arb[N],a,b,poz,rez,val,n;
int query(int p, int st ,int dr)
{
    if(a<=st && dr<=b)
    {
        return arb[p];
    }
    int m=(st+dr)/2;
    int m1=-1,m2=-1;
    if(a<=m){
        m1=query(2*p,st,m);
    }
    if(b>m){
        m2=query(2*p+1,m+1,dr);
    }
    return max(m1,m2);
}

void update(int p, int st , int dr)
{
    if(st==dr){
        arb[p]=val;
        return;
    }
    int m=(st+dr)/2;
    if(poz<=m){
        update(2*p,st,m);
    }
    else{
        update(2*p+1,m+1,dr);
    }
    arb[p]=max(arb[2*p],arb[2*p+1]);
}

int main()
{
    int nr,i,x;
    in>>n>>nr;
    for(i=1 ; i<=n ; i++)
    {
        in>>val;
        poz=i;
        update(1,1,n);
    }
    for(i=1 ; i<=nr ; i++)
    {
        in>>x;

        if(x==1)
        {
            in>>poz>>val;
            update(1,1,n);
        }
        if(x==0)
        {
            in>>a>>b;
            out<<query(1,1,n)<<"\n";
        }
    }
    return 0;
}