Cod sursa(job #962445)

Utilizator radu_bucurRadu Bucur radu_bucur Data 15 iunie 2013 10:44:29
Problema Arbori de intervale Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include <fstream>
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
int ma[100001],n,m,i,x,y,g;
void uptd(int nod, int st, int dr)
{
    if(st==dr)
    {
        ma[nod]=y;
        return;
    }
    int mij;
    mij=(st+dr)/2;
    if(x<=mij) uptd(nod*2,st,mij);
    uptd(nod*2+1,mij+1,dr);
    if (ma[2*nod+1]>ma[2*nod])
    {
        ma[nod]=ma[2*nod+1];
    }
    else
    {
        ma[nod]=ma[2*nod];
    }
}
int maxim(int nod, int st, int dr)
{
      if(x<=st&&y>=dr) return ma[nod];
      int mij,m1,m2;
      m1=0; m2=0; mij=(st+dr)/2;
      if(x<=mij) m1=maxim(2*nod,st,mij);
      if(y>mij) m2=maxim(2*nod+1,mij+1,dr);
      if (m1>m2) return m1;
      return m2;
}

int main()
{
    in>>n>>m;
    for(i=1;i<=n;i++)
    {
        in>>y;
        x=i;
        uptd(1,1,n);
    }
    for(i=1;i<=m;i++)
    {
        in>>g>>x>>y;
        if(g==1) uptd(1,1,n);
        if(g==0)
        {
            out<<maxim(1,1,n)<<"\n";
        }
    }
    return 0;
}