Cod sursa(job #1248134)

Utilizator lianaliana tucar liana Data 24 octombrie 2014 18:34:51
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.31 kb
#include<stdio.h>
#include<stdio.h>
#define nndmax 263000
int x, n, i, rez, op, poz, a, b, m;
int v[nndmax];

void update(int st, int dr, int nod)
{
    int mjc;
    if (st==dr)
        v[nod]=x;
    else
    {
        mjc=(st+dr)/2;
        if (poz<=mjc)
            update(st,mjc,2*nod);
        else
            update(mjc+1,dr,2*nod+1);
        v[nod]=v[2*nod];
        if (v[2*nod+1]>v[nod])
            v[nod]=v[2*nod+1];
    }
}

void query(int st, int dr, int nod)
{
    int mjc;
    if ((a<=st)&&(dr<=b))
    {
        if (v[nod]>rez)
            rez=v[nod];
    }
    else
    {
        mjc=(st+dr)/2;
        if (a<=mjc)
            query(st,mjc,2*nod);
        if (mjc<b)
            query(mjc+1,dr,2*nod+1);
    }
}

int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%ld %ld",&n,&m);
    for (i=1;i<=n;i++)
    {
        scanf("%ld",&x);
        poz=i;
        update(1,n,1);
    }
    for (i=1;i<=m;i++)
    {
        scanf("%ld",&op);
        if (op==1)
        {
            scanf("%ld %ld",&poz,&x);
            update(1,n,1);
        }
        else
        {
            scanf("%ld %ld",&a,&b);
            rez=0;
            query(1,n,1);
            printf("%ld\n",rez);
        }
    }
    return 0;
}