Cod sursa(job #2209745)

Utilizator MatteusTanase Matei Matteus Data 4 iunie 2018 16:36:24
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <fstream>
using namespace std;

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

const int N=2<<18;
const int INF=999999999;

int a, b, poz, val, t[N], tip, intrebari, n;

int intr(int p, int st, int dr)
{
    if(a<=st && dr<=b)
        return t[p];
    int m=(st+dr)/2, r=-INF;
    if(a<=m)
        r=max(r, intr(2*p, st, m));
    if(b>m)
        r=max(r, intr(2*p+1, m+1, dr));
    return r;
}

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

    t[p]=max(t[2*p], t[2*p+1]);
}

void citire()
{
    cin>>n>>intrebari;
    for(int i=1; i<=n; i++)
    {
        cin>>val;
        poz=i;
        update(1, 1, n);
    }
    for(int i=1; i<=intrebari; i++)
    {
        cin>>tip;//>>x>>y;
        if(!tip){
            cin>>a>>b;
            cout<<intr(1,1,n)<<'\n';
        }
        else
        {
            cin>>poz>>val;
            update(1, 1, n);
        }
    }
}

int main()
{
    citire();
    return 0;
}