Cod sursa(job #2352275)

Utilizator strutzMihai Vlad strutz Data 23 februarie 2019 10:34:43
Problema Arbori de intervale Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.42 kb
#include <fstream>

using namespace std;

ifstream f("arbint.in");
ofstream g("arbint.out");
#define dim 100001

int n, m;
int maxarb[4*dim+66];
int start, sf, val, pos, maxim;

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

void actualizare(int nod, int st, int dr)
{
    if ( st == dr )
    {
        maxarb[nod] = val;
        return;
    }

    int div = (st+dr)/2;
    if ( pos <= div )
        actualizare(2*nod,st,div);
    else
        actualizare(2*nod+1,div+1,dr);

    maxarb[nod] = Maxim( maxarb[2*nod], maxarb[2*nod+1] );
}

void interogare(int nod, int st, int dr)
{
    if ( start <= st && dr <= sf )
    {
        if ( maxim < maxarb[nod] )
            maxim = maxarb[nod];
        return;
    }

    int div = (st+dr)/2;
    if ( start <= div )
        interogare(2*nod,st,div);
    if ( div < sf )
        interogare(2*nod+1,div+1,dr);
}


int main()
{
    int x, A, B;
    f>>n>>m;
    for ( int i = 1; i <= n; i++ )
    {
        f>>x;
        pos = i, val = x;
        actualizare(1,1,n);
    }

    for ( int i = 1; i <= m; i++ )
    {
        f>>x>>A>>B;
        if ( x == 0 )
        {
            maxim = -1;
            start = A, sf = B;
            interogare(1,1,n);

            g<<maxim<<endl;
        }
        else
        {
            pos = A, val = B;
            actualizare(1,1,n);
        }
    }
}