Cod sursa(job #1717368)

Utilizator zertixMaradin Octavian zertix Data 14 iunie 2016 19:10:38
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.22 kb
#include <iostream>
#include <cstdio>
#define dimen 100001
using namespace std;

int n,m,x,poz,a,b,maxim;
int v[4*dimen+50];

void update(int st,int dr,int nod)
{
    if (st==dr)
    {
        v[nod]=x;
        return;
    }
    int mij=(st+dr)/2;
    if (mij<poz)
        update(mij+1,dr,2*nod+1);
        else
            update(st,mij,2*nod);
    v[nod]=max(v[2*nod],v[2*nod+1]);
}
void query(int st,int dr,int nod)
{
    if (a<=st && dr<=b)
    {
        if (maxim<v[nod])
            maxim=v[nod];
        return;
    }
    int mij=(st+dr)/2;
    if (a<=mij)
        query(st,mij,2*nod);
    if (b>mij)
        query(mij+1,dr,2*nod+1);

}
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);
        poz=i;
        update(1,n,1);
    }
    for (int i=1;i<=m;++i)
    {
        int op;
        scanf("%d%d%d",&op,&a,&b);
        if(op==1)
        {
            x=b;
            poz=a;
            update(1,n,1);
        }
        else
        {
            maxim=-1;
            query(1,n,1);
            printf("%d\n",maxim);
        }
    }
    return 0;
}