Cod sursa(job #3207342)

Utilizator cacamaca12aasdga cacamaca12 Data 25 februarie 2024 22:10:44
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.37 kb
#include <fstream>
#define dim 100002
using namespace std;

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

int n,m,sol;
int ai[4*dim],v[dim];

void build(int st,int dr,int nod){
    if(st==dr){
        ai[nod]=v[st];
        return;
    }
    
    int mij=(st+dr)/2;
    
    build(st,mij,2*nod);
    build(mij+1,dr,2*nod+1);
    
    ai[nod]=max(ai[2*nod],ai[2*nod+1]);
}

void query(int st,int dr,int a,int b,int nod){
    if(st>=a && dr<=b){
        sol=max(sol,ai[nod]);
        return;
    }
    
    int mij=(st+dr)/2;
    
    if(a<=mij)
        query(st,mij,a,b,2*nod);
        
    if(b>mij)   
        query(mij+1,dr,a,b,2*nod+1);
}

void update(int st,int dr,int poz,int val,int nod){
    if(st==dr){
        ai[nod]=val;
        return;
    }
    
    int mij=(st+dr)/2;
    
    if(poz<=mij)
        update(st,mij,poz,val,2*nod);
    else update(mij+1,dr,poz,val,2*nod+1);
    
    ai[nod]=max(ai[2*nod],ai[2*nod+1]);
}

int main()
{
    cin>>n>>m;
    
    for(int i=1;i<=n;++i)
        cin>>v[i];
        
    build(1,n,1);
    
    for(int i=1;i<=m;++i){
        int op;
        cin>>op;
        if(op==0){//query
            int a,b;
            cin>>a>>b;
            sol=0;
            query(1,n,a,b,1);
            cout<<sol<<'\n';
        }else{
            int poz,el;
            cin>>poz>>el;
            update(1,n,poz,el,1);
        }
            
    }
    return 0;
}