Cod sursa(job #2253688)

Utilizator YouDontNeedMyNameJurcut Paul YouDontNeedMyName Data 4 octombrie 2018 11:49:11
Problema Arbori de intervale Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.18 kb
#include <bits/stdc++.h>
#define Nmax 100005
using namespace std;
ifstream in("arbint.in");
ofstream out("arbint.out");
// Victor nu mai copia !!!
int n,m,arb[4*Nmax];
void add(int st, int dr, int pos, int pos1, int val)
{
    int mi=(st+dr)/2;
    if(st==dr)
    {
        arb[pos]=val;
        return;
    }
    if(pos1<=mi)
    {
        add(st,mi,2*pos,pos1,val);
    }
    else
    {
        add(mi+1,dr,2*pos+1,pos1,val);
    }
    arb[pos]=max(arb[2*pos],arb[2*pos+1]);
}
int fnd(int st, int dr, int a, int b, int pos)
{
    int v1=0,v2=0,mi=(st+dr)/2;
    if(st>=a && dr<=b) return arb[pos];
    if(st>b || dr<a) return 0;
    if(a<=mi)
    {
        v1=fnd(st,mi,a,b,2*pos);
    }
    if(b>=mi)
    {
        v2=fnd(mi+1,dr,a,b,2*pos+1);
    }
    return max(v1,v2);
}
int main()
{
    in >> n >> m;
    for(int i=1; i<=n; i++)
    {
        int x;
        in >> x;
        add(1,n,1,i,x);
    }
    for(int i=1; i<=m; i++)
    {
        int c,a,b;
        in >> c >> a >> b;
        if(c==1)
        {
            add(1,n,1,a,b);
        }
        else
        {
            out << fnd(1,n,a,b,1) << '\n';
        }
    }
    return 0;
}