Cod sursa(job #855403)

Utilizator mihai10stoicaFMI - Stoica Mihai mihai10stoica Data 14 ianuarie 2013 22:07:14
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.2 kb
#include<cstdio>
#define dim 100001
int n,m,arb[4*dim+66],start,finish,val,pos,maxim;
int mx(int a,int b) {if(a>b) return a; return b;}
void query(int nod,int l,int r)
{
    if(start<=l && r<=finish)
    {
        if(maxim<arb[nod]) maxim=arb[nod];
        return;
    }
    int div=(l+r)/2;
    if(start<=div) query(2*nod,l,div);
    if(div<finish) query(2*nod+1,div+1,r);
}
void update(int nod,int l,int r)
{
    if(l==r)
    {
        arb[nod]=val;
        return;
    }
    int div=(l+r)/2;
    if(pos<=div) update(2*nod,l,div);
    else update(2*nod+1,div+1,r);
    arb[nod]=mx(arb[2*nod],arb[2*nod+1]);
}
int main()
{
    int x, a, b;
    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);
        pos=i;val=x;
        update(1,1,n);
    }  
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&a,&b);
        if(x==0)
        {
             maxim=-1;
             start=a;finish=b;
             query(1,1,n);
             printf("%d\n", maxim);
        }
        else
        {
            pos=a;val=b;
            update(1,1,n);
        }
    }
    return 0;
}