Cod sursa(job #2272925)

Utilizator filicriFilip Crisan filicri Data 30 octombrie 2018 19:35:35
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include <iostream>
#include <fstream>
#define lim 100004
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int n,m,x,op,a,b,sgt[4*lim];
int maxim (int a,int b)
{
    if (a>b) return a;
    return b;
}
int query (int nod,int st,int dr,int a,int b)
{
    if (st>b || dr<a) return 0;
    if (st>=a && dr<=b) return sgt[nod];
    int mij=(st+dr)/2,nods=nod*2;
    return maxim(query(nods,st,mij,a,b),query(nods+1,mij+1,dr,a,b));
}
void update (int nod,int st,int dr,int poz,int val)
{
    if (st==dr)
    {
        sgt[nod]=val;
        return;
    }
    int mij=(st+dr)/2,nods=nod*2;
    if (poz<=mij) update (nods,st,mij,poz,val);
    else update(nods+1,mij+1,dr,poz,val);
    sgt[nod]=maxim(sgt[nods],sgt[nods+1]);
}
int main()
{
    f>>n>>m;
    for (int i=1;i<=n;i++)
    {
        f>>x;
        update(1,1,n,i,x);
    }
    for (int i=1;i<=m;i++)
    {
        f>>op>>a>>b;
        if (op) update(1,1,n,a,b);
        else g<<query(1,1,n,a,b)<<'\n';
    }
    f.close();
    g.close();
    return 0;
}