Cod sursa(job #2852215)

Utilizator Iordache_CezarIordache Cezar Iordache_Cezar Data 19 februarie 2022 11:57:05
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.38 kb
#include <fstream>
#define NMAX 100002

using namespace std;
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");

int n, m, segm[NMAX * 4 + 8];

void citire();
void update(int nod, int st, int dr, int poz, int val);
int query(int nod, int st, int dr, int qst, int qdr);

int main()
{
    citire();
    return 0;
}

void citire()
{
    int x, y, cerinta;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> x;
        update(1, 1, n, i, x);
    }
    for (int i = 1; i <= m; i++)
    {
        fin >> cerinta >> x >> y;
        if (cerinta == 0)
            fout << query(1, 1, n, x, y) << '\n';
        else
            update(1, 1, n, x, y);
    }
}

void update(int nod, int st, int dr, int poz, int val)
{
    if (st == dr)
    {
        segm[nod] = val;
        return;
    }
    int mij = (st + dr) / 2;
    if (poz <= mij)
        update(2 * nod, st, mij, poz, val);
    else
        update(2 * nod + 1, mij + 1, dr, poz, val);
    segm[nod] = max(segm[2*nod], segm[2*nod+1]);
}

int query(int nod, int st, int dr, int qst, int qdr)
{
    int x = 0, y = 0;
    if (qst <= st && dr <= qdr)
        return segm[nod];
    int mij = (st + dr) / 2;
    if (qst <= mij)
        x = query(2 * nod, st, mij, qst, qdr);
    if (mij + 1 <= qdr)
        y = query(2 * nod + 1, mij + 1, dr, qst, qdr);
    return max(x, y);
}