Cod sursa(job #1506494)

Utilizator zertixMaradin Octavian zertix Data 20 octombrie 2015 19:00:47
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.35 kb
#include <iostream>
#include <cstdio>
#define dim 100005
using namespace std;

int p,x,n,m,val,arb[4*dim+100],st,fin,maxim;
int a,b,start;

void creare_arb(int, int ,int );
void query(int, int ,int );


int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;++i)
    {
        scanf("%d",&x);
        p=i;val=x;
        creare_arb(1,1,n);
    }
    for (int i=1;i<=m;++i)
    {
        scanf("%d%d%d",&x,&a,&b);
        if (x==0)
        {
            maxim=-1;
            start=a;fin=b;
            query(1,1,n);
            printf("%d\n",maxim);
        }
        else
        {
            p=a;
            val=b;
            creare_arb(1,1,n);
        }
    }



    return 0;
}

void creare_arb(int nod,int st,int dr)
{
    if (st == dr)
    {
        arb[nod]=val;
        return;
    }
    int div=(st+dr)/2;
    if (p<=div) creare_arb(2*nod,st,div);
        else creare_arb(2*nod+1,div+1,dr);
    arb[nod]=max(arb[2*nod],arb[2*nod+1]);
}
void query(int nod,int st,int dr)
{
    if (start<=st && dr<=fin)
        {
            if (arb[nod]>maxim) maxim=arb[nod];
            return;
        }
    int div=(st+dr)/2;
    if (start<=div)
        query(2*nod,st,div);
    if (div<fin)
            query(2*nod+1,div+1,dr);
}