Cod sursa(job #1511872)

Utilizator ionut98Bejenariu Ionut Daniel ionut98 Data 27 octombrie 2015 11:29:53
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");
#define dim 100001
int v[4*dim];
int x,mx,n,m,i,cer,a,b;
void update(int nod,int st,int dr,int poz,int val)
{
    if(st==dr)
      v[nod]=val;
    else
    {
        int mij=(st+dr)/2;
        if(poz<=mij)
          update(nod*2,st,mij,poz,val);
        else
          update(nod*2+1,mij+1,dr,poz,val);
        v[nod]=max(v[2*nod],v[2*nod+1]);
    }
}
void caut(int nod,int st,int dr,int inc,int sf)
{
    if(inc<=st&&dr<=sf)
      mx=max(mx,v[nod]);
    else
    {
        int mij=(st+dr)/2;
        if(inc<=mij)
          caut(nod*2,st,mij,inc,sf);
        else
          caut(nod*2+1,mij+1,dr,inc,sf);
    }
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++)
    {
        f>>x;
        update(1,1,n,i,x);
    }
    while(m)
    {
        m--;
        f>>cer>>a>>b;
        if(cer==0)
        {
            mx=-1;
            caut(1,1,n,a,b);
            g<<mx<<"\n";
        }
        else
          update(1,1,n,a,b);
    }
    return 0;
}