Cod sursa(job #693937)

Utilizator alexapoApostol Alexandru Ionut alexapo Data 27 februarie 2012 17:47:47
Problema Arbori de intervale Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.07 kb
#include <fstream>

using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n,m,i,v[500005],mij,poz,x,o,t1,t2;
int maxima(int nod,int st,int dr)
{
    if(st>=t1&&dr<=t2)
    return v[nod];
    else
    {
        int mij=(st+dr)/2;
        int r=-1;
        if(mij>=t1)r=max(r, maxima(2*nod,st,mij));
        else
        if(mij<t2)r=max(r, maxima(2*nod+1,mij+1,dr));
        return r;
    }
}
void adauga(int nod,int st,int dr)
{
    if(st==dr)
    {
        v[nod]=x;
    }
    else
    {
        int mij=(st+dr)/2;
        if(poz<=mij)
        adauga(2*nod,st,mij);
        else
        adauga(2*nod+1,mij+1,dr);
        v[nod]=max(v[2*nod],v[2*nod+1]);
    }

}


int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>x;
        poz=i;
        adauga(1,1,n);
    }
    for(i=1;i<=m;i++)
    {
        f>>o>>t1>>t2;
        x=t2;
        if(o)
        poz=t1,adauga(1,1,n);
        else
        {
            g<<maxima(1,1,n)<<'\n';
        }
    }
    f.close();
    g.close();
    return 0;
}