Cod sursa(job #2902437)

Utilizator AdelaCorbeanuAdela Corbeanu AdelaCorbeanu Data 16 mai 2022 12:55:28
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.14 kb
#include <fstream>
#include <vector>

std::vector<int> aint(500000, 0);

void build (int nod, int left, int right, int poz, int x) {
    if (poz < left || poz > right) return;
    if (left == right) aint[nod] = x;
    else {
        int mij = (right + left) / 2;

        if (poz <= mij) build(nod * 2, left, mij, poz, x);
        else build(nod * 2 + 1, mij + 1, right, poz, x);

        aint[nod] = std::max(aint[nod * 2], aint[nod * 2 + 1]);
    }
}

int max_value (int nod, int left, int right, int a, int b) {
    if (a > right || b < left) return 0;
    if (a <= left && right <= b) return aint[nod];

    int mij = (left + right) / 2;
    return std::max(max_value(nod * 2 + 1, mij + 1, right, a, b), max_value(nod * 2, left, mij, a, b));
}

int main()
{
    std::ifstream fin("arbint.in");
    std::ofstream fout("arbint.out");

    int n, m, x;
    fin >> n >> m;

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

    int op, a, b;
    for (int i = 0; i < m; ++i) {
        fin >> op >> a >> b;

        if (op == 0) fout << max_value(1, 1, n, a, b) << '\n';
        else build(1, 1, n, a, b);
    }

    return 0;
}