Cod sursa(job #1074858)

Utilizator dan.ghitaDan Ghita dan.ghita Data 8 ianuarie 2014 00:41:07
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.08 kb
#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");

const int n_max=100001;

int n, m, i, v, vmax[4*n_max+66], t, a, b, mx;

int max(int a, int b)
{
    if(a>b) return a;
    return b;
}

void push(int nod, int st, int dr)
{
    int m;
    if(st==dr)
    {
        vmax[nod]=b;
        return;
    }
    m=(st+dr)/2;
    if(a<=m) push(2*nod, st, m);
    else push(2*nod+1, m+1, dr);
    vmax[nod]=max(vmax[2*nod], vmax[2*nod+1]);
}

void elmax(int nod, int st, int dr)
{
    int m;
    if(a<=st && dr<=b)
    {
        if(mx<vmax[nod]) mx=vmax[nod];
        return;
    }
    m=(st+dr)/2;
    if(a<=m) elmax(2*nod, st, m);
    if(m<b) elmax(2*nod+1, m+1, dr);
}
int main()
{
    cin>>n>>m;
    for(i=1; i<=n; i++)
    {
        cin>>v;
        a=i;
        b=v;
        push(1, 1, n);
    }
    while(m--)
    {
        cin>>t>>a>>b;
        if(!t)
        {
            mx=-1;
            elmax(1, 1, n);
            cout<<mx<<'\n';
        }
        else push(1, 1, n);
    }
    return 0;
}