Cod sursa(job #2646701)

Utilizator tryharderulbrebenel mihnea stefan tryharderul Data 1 septembrie 2020 18:22:50
Problema Arbori de intervale Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#include <iostream>
#include <stdio.h>

#define NMAX 500003

using namespace std;

int n,m,i,x,hmax,cer,y,ind;
int a[4*NMAX];

void update(int nod,int st,int dr){
    int mid=(st+dr)/2;

    if(st==dr)
        a[nod]=x;
    else{
        if(ind<=mid)
            update(2*nod,st,mid);
        else
            update(2*nod+1,mid+1,dr);

        a[nod]=max(a[nod*2],a[nod*2+1]);
    }
}

void query(int nod,int st,int dr){
    int mid=(st+dr)/2;

    if(st>=x && dr<=y){
        hmax=max(hmax,a[nod]);

    }else{
        if(x<=mid)
            query(2*nod,st,mid);

        if(y>mid)
            query(2*nod+1,mid+1,dr);
    }

}

int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);

    scanf("%d%d",&n,&m);

    for(i=1;i<=n;i++){
        scanf("%d",&x);
        ind=i;
        update(1,1,n);
    }

    for(i=1;i<=n;i++){
        scanf("%d%d%d",&cer,&x,&y);

        if(!cer){
           hmax=0;
           query(1,1,n);

           printf("%d\n",hmax);
        }else{
            ind=x;
            update(1,1,n);
        }

    }


    return 0;
}