Cod sursa(job #3208515)

Utilizator Pop_AlexandruPop Alexandru Pop_Alexandru Data 28 februarie 2024 19:09:45
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.27 kb
#include <fstream>
using namespace std;

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

#define NMAX 4 * 100005

int v[NMAX];
int poz, val;
int a, b;
int maxim;

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

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

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        int x;
        fin >> x;

        poz = i;
        val = x;
        update(1, 1, n);
    }

    while (m--) {
        int op;
        fin >> op >> a >> b;

        if (op == 0) {
            maxim = -1;
            query(1, 1, n);
            fout << maxim << '\n';
        } else {
            poz = a;
            val = b;
            update(1, 1, n);
        }
    }
    return 0;
}