Cod sursa(job #3341467)

Utilizator DoltuVladDoltu Vlad DoltuVlad Data 19 februarie 2026 17:22:34
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.27 kb
#include <fstream>
#define NMAX 400005
using namespace std;
ifstream cin ("arbint.in");
ofstream cout ("arbint.out");
int arbint[NMAX];
int n,x,y,tip,m,a,b;
void update(int poz, int val, int nod, int in, int sf)
{
    if (in==sf)
    {
        if (in==poz)
        {
            arbint[nod]=val;
        }
        return;
    }
    int mij=(in+sf)/2;
    if (in<=poz && poz<=mij)
        update(poz,val,2*nod,in,(in+sf)/2);
    if (mij<poz && poz<=sf)
        update(poz,val,2*nod+1,(in+sf)/2+1,sf);
    arbint[nod]=max(arbint[2*nod],arbint[2*nod+1]);
}

int querry(int st, int dr, int nod, int in, int sf)
{
    if (st<=in && sf<=dr)
    {
        return arbint[nod];
    }
    int mij=(in+sf)/2;
    if (mij<st)
        return querry(st,dr,2*nod+1,mij+1,sf);
    if (mij>=dr)
        return querry(st,dr,2*nod,in,mij);
    return max(querry(st,dr,2*nod,in,mij), querry(st,dr,2*nod+1,mij+1,sf));
}

int main()
{
    cin>>n>>m;
    for (int i=1;i<=n;i++)
    {
        cin>>x;
        update(i,x,1,1,n);
    }
    for (int i=1;i<=m;i++)
    {
        cin>>tip>>a>>b;
        if (tip==1)
        {
            update(a,b,1,1,n);
        }
        else
        {
            cout<<querry(a,b,1,1,n)<<endl;
        }
    }
    return 0;
}