Cod sursa(job #1493422)

Utilizator Eman98Ghinea Mihail Emanuel Eman98 Data 29 septembrie 2015 12:21:35
Problema Arbori de intervale Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.12 kb
#include<fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int maxarb[4*100001+5],pos,val,a,b,n,m,i,Max,st,dr;
void up(int nod,int st ,int dr)
{
    if(st==dr)
    {
        maxarb[nod]=val;
        return;
    }
    int mij=(st+dr)/2;
    if(pos<=mij)
        up(nod*2,st,mij);
    else
        up(nod*2+1,mij+1,dr);
    maxarb[nod]=max(maxarb[2*nod],maxarb[2*nod+1]);
}
void q(int nod,int st,int dr)
{
    if(start<=st && dr<=fin)
    {
        Max=max(Max,maxarb[nod]);
        int div = (left+right)/2;
        if ( start <= div ) q(2*nod,left,div);
        if ( div < fin ) q(2*nod+1,div+1,right);
    }
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        cin>>x;
        val=x;
        pos=i;
        up(1,1,n)
    }
    for(i=1;i<=m;i++)
    {
        cin>>p>>a>>b;
        if(p)
        {
            pos=a;
            val=b;
            up(1,1,n);
        }
        else
        {
            Max=-1;
            start=a;
            fin=b;
            q(1,1,n);
            cout<<Max<<"\n";
        }
    }
    return 0;
}