Cod sursa(job #1304357)

Utilizator gapdanPopescu George gapdan Data 28 decembrie 2014 21:03:19
Problema Arbori de intervale Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include<cstdio>
#define max(a,b) (a>b?a:b)
#define NMAX 100005
using namespace std;
int n,m,i,Max,s,d,x,y,poz,val,sol,t;
int arb[2*NMAX];
void solve(int nod,int st,int dr)
{
    if (s<=st && dr<=d)
    {
        if (Max<arb[nod]) Max=arb[nod];
        return;
    }
    int mij=(st+dr)/2;
    if (s<=mij) solve(nod*2,st,mij);
    if (mij<d) solve(nod*2+1,mij+1,dr);
}
void update(int nod,int st,int dr)
{
    if (st==dr)
    {
        arb[nod]=val;
        return;
    }
    int mij=(st+dr)/2;
    if (poz<=mij) update(nod*2,st,mij);
        else update(nod*2+1,mij+1,dr);
    arb[nod]=max(arb[nod*2],arb[nod*2+1]);
}
int main()
{
    freopen("arbint.in","r",stdin);
    freopen("arbint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=n;++i)
    {
        scanf("%d",&x);
        poz=i;val=x;
        update(1,1,n);
    }
    for (i=1;i<=m;++i)
    {
        scanf("%d%d%d",&t,&x,&y);
        if (t==0)
        {
            Max=-1;s=x,d=y;
            solve(1,1,n);
            printf("%d\n",Max);
        }
        else
        {
            poz=x;val=y;
            update(1,1,n);
        }
    }
    return 0;
}