Cod sursa(job #3134187)

Utilizator Razvan2699Mircea Andrei Razvan Razvan2699 Data 28 mai 2023 18:11:27
Problema Arbori de intervale Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#include <iostream>
#include <fstream>
#include <limits>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");

int aint[500003];
int maxx=INT_MIN;


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

    aint[i]=max(aint[2*i],aint[2*i+1]);
}




void query(int i, int st, int dr, int a, int b)
{
    if(a<=st && dr<=b) {
        if(maxx<aint[i])
            maxx=aint[i];
        return ;
    }

    int mid = (st + dr)/2;
    if(a<=mid) query(2*i,st,mid,a,b);
    if(b>mid) query(2*i+1,mid+1,dr,a,b);
}

int main()
{
    int n,m,val,a,b,i;
    in>>n>>m;

    for(i=1;i<=n;i++)
    {
        in>>val;
        update(1,1,n,i,val);
    }

    for(i=0;i<m;i++)
    {
        in>>val>>a>>b;
        if(val==0)
        {
            maxx=INT_MIN;
            query(1,1,n,a,b);
            out<<maxx<<endl;
        }

        if(val==1)
            update(1,1,n,a,b);
    }

    return 0;
}