Cod sursa(job #1146183)

Utilizator RadEmanuelRad Emanuel RadEmanuel Data 18 martie 2014 19:45:42
Problema Arbori de intervale Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
#include<fstream>
#define DMAX 10
#define INF 21000000
using namespace std;

ifstream fin ("arbint.in");
ofstream fout("arbint.out");
int n,m,v[DMAX],x,i,op,a,b,j,maxx;

void add(int nod, int st, int dr)
{
    if(st==dr)
    {
        v[nod]=x;
        return;
    }
    int div=(st+dr)/2;
    if(i<=div) add(2*nod,st,div);
          else add(2*nod+1,div+1,dr);
    v[nod]=v[2*nod]>v[2*nod+1] ? v[2*nod] : v[2*nod+1];
}

void cauta(int nod, int st, int dr)
{
    if(a<=st && dr<=b)
    {
        maxx=maxx>v[nod] ? maxx : v[nod];
        return;
    }
    int div=(st+dr)/2;
    if(a<=div) cauta(2*nod,st,div);
    if(div<b)  cauta(2*nod+1,div+1,dr);
}

int main()
{
    fin>>n>>m;
    for(i=1;i<=n;++i)
    {
        fin>>x;
        add(1,1,n);
    }
    for(j=1;j<=m;++j)
    {
        fin>>op>>a>>b;
        if(!op)
        {
            maxx=-INF;
            cauta(1,1,n);
            fout<<maxx<<'\n';
        }
        else
        {
            i=a; x=b;
            add(1,1,n);
        }
    }
    return 0;
}