Cod sursa(job #2903721)

Utilizator AnaVoineaVoinea Ana Maria AnaVoinea Data 17 mai 2022 20:09:19
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.33 kb
#include <iostream>
#include <fstream>

using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");

int a[4000001];
void creaza_arb (int nod, int l, int r, int poz, int x )
{

    if(poz < l || poz > r) return;
    if(l == r)
    {
        a[nod]=x;
        return;
    }
    int m =(l+r)/2;
    creaza_arb(2*nod, l, m, poz, x);
    creaza_arb (2*nod+1, m+1, r, poz, x);

    a[nod] = max(a[2*nod], a[2*nod+1]);
}
int maxim(int nod, int l, int r, int st, int dr)
{
    if(st > r || dr < l) return 0;
    if( l >= st && r <= dr) return a[nod];

    int m=(l+r)/2;
    return max(maxim(2*nod, l, m, st, dr), maxim(2*nod+1, m+1, r, st, dr));
}

void modifica (int nod, int l, int r, int poz, int x )
{

    if(poz > r || x < l) return;
    if(l == r)
    {
        a[nod]=x;
    }
    int m =(l+r)/2;
    if(poz<=m) modifica(2*nod, l, m, poz, x);
    else modifica(2*nod+1, m+1, r, poz, x);

    a[nod] = max( a[2*nod], a[2*nod+1]);

}

int main()
{
    int n, t;
    f>>n>>t;

    for( int i=1; i<=n; i++)
    {
        int a;
        f>>a;
        creaza_arb(1, 1, n, i, a);
    }

    int ope, a, b;
    for ( int i=1; i<=t; i++)
    {
        f>>ope>>a>>b;
        if(ope==0) { g<<maxim(1, 1, n, a, b)<<"\n";}
        else creaza_arb(1, 1, n, a, b);

    }
    return 0;
}