Cod sursa(job #2783305)

Utilizator Ricardo14Olaru Ricardo Ricardo14 Data 14 octombrie 2021 10:51:04
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.12 kb
#include <fstream>

using namespace std;
int aint[500005],n,put=1;

ifstream cin("arbint.in");
ofstream cout("arbint.out");
void up(int i, int val)
{
    int poz=put-1+i;
    aint[poz]=val;
    while(poz>1)
    {
        poz/=2;
        aint[poz]=max(aint[poz*2],aint[poz*2+1]);
    }
}

int query(int ind,int csta, int cdra ,int cstq ,int cdrq)
{
    if(cstq<=csta && cdra<=cdrq)
        return aint[ind];

    else
    {
        int aux=-1;

        if(cstq <= (csta + cdra)/2)
            aux=query(ind*2 , csta , (csta+cdra)/2 , cstq , cdrq);

        if(cdrq>(csta+cdra)/2)

        aux=max(aux , query(ind*2+1 , (csta+cdra)/2+1 , cdra , cstq , cdrq));

      return aux;
    }
}
int main()
{
 int m,cer,a,b,aux1;
 cin>>n>>m;

 while(put<n)
 {
     put*=2;

 }
 for(int i=put;i<=put+n-1;i++)
 {
     cin>>aint[i];
 }

 for(int i=put-1;i>=1;i--)
 {
     aint[i]=max(aint[i*2],aint[i*2+1]);
 }

 for(int i=0;i<m;i++)
{
   cin>>cer>>a>>b;

   if(cer==0)
   {
       aux1=query(1,1,put,a,b);
       cout<<aux1<<'\n';
   }
   else
   {
       up(a,b);
   }


}    return 0;
}