Cod sursa(job #339827)

Utilizator PavelRazvanPavel Razvan PavelRazvan Data 11 august 2009 18:46:56
Problema Arbori de intervale Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.2 kb
#include<stdio.h>
#define DIM 100005
int a[DIM],v[3*DIM];
int max (int x,int y)
{
    if(x<y)
        return y;
    return x;
}
void arbint (int st,int dr,int x,int val,int k)
{
    int mij=(st+dr)/2;
    if(st==dr)
        v[k]=val;
    else
    {
        if(x<=mij)
			arbint(st,mij,x,val,2*k);
		else
			arbint(mij+1,dr,x,val,2*k+1);
		v[k]=max(v[2*k],v[2*k+1]);
    }
}
int query (int x,int y,int st,int dr,int k)
{
    int mij=(st+dr)/2;
    if(st>y || dr<x)
        return 0;
    else
    {
        if(x<=st && dr<=y)
            return v[k];
        else
            return max(query(x,y,st,mij,2*k),query(x,y,mij+1,dr,2*k+1));
    }
}
int main ()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    int i,q,x,y,n,m;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i)
    {
		scanf("%d",&a[i]);
        arbint(1,n,i,a[i],1);
    }
    for(i=1;i<=m;++i)
    {
        scanf("%d%d%d",&q,&x,&y);
        if(q==0)
        {
            int w=query(x,y,1,n,1);
            if(w==0)
                printf("-1\n");
            else
                printf("%d\n",w);
        }
        else
            arbint(1,n,x,y,1);
    }
    return 0;
}