Cod sursa(job #2953608)

Utilizator adelinapetreAdelina Petre adelinapetre Data 11 decembrie 2022 19:28:13
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.15 kb
#include <fstream>
using namespace std;
#define int long long
ifstream cin("arbint.in");
ofstream cout("arbint.out");
long long v[4*200005];
int join (int x, int y)
{
    return max(x,y);
}
void update(int a, int poz, int st, int dr, int cr)
{
    if(st==dr)
    {
        v[cr]=a;
        return;
    }
    int mid=(st+dr)/2;
    if(poz<=mid)
        update(a,poz,st,mid,2*cr);
    else if(poz>mid)
        update(a,poz,mid+1,dr,2*cr+1);
    v[cr]=join(v[2*cr],v[2*cr+1]);
}
int query(int qst, int qdr, int st, int dr, int cr)
{
    int mid=(st+dr)/2;
    if(st==qst && dr==qdr)
        return v[cr];
    if(qdr<=mid)
        return query(qst,qdr,st,mid,2*cr);
    else if (qst>mid)
        return query(qst,qdr,mid+1,dr,2*cr+1);
    return join(query(qst,mid,st,mid,2*cr),query(mid+1,qdr,mid+1,dr,2*cr+1));
}
int32_t main()
{
    int n,q,i,t,a,b;
    cin>>n>>q;
    for(i=1; i<=n; i++)
    {
        cin>>a;
        update(a,i,1,n,1);
    }
    while(q>0)
    {
        cin>>t>>a>>b;
        if(t==1)
            update(b,a,1,n,1);
        else
            cout<<query(a,b,1,n,1)<<'\n';
        q--;
    }
    return 0;
}