Cod sursa(job #3221350)

Utilizator Mihai_999Diaconeasa Mihai Mihai_999 Data 6 aprilie 2024 20:19:42
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.17 kb
#include <iostream>
#include <fstream>
#define nl '\n'

using namespace std;

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

const int NMAX = 100001;
int Ai[4*NMAX];

void Update(int rad, int st, int dr, int poz, int val)
{
    if (st == dr)
        Ai[rad] = val;
    else
    {
        int m = (st+dr)/2;
        if (poz <= m)
            Update(2*rad, st, m, poz, val);
        else
            Update(2*rad+1, m+1, dr, poz, val);
        Ai[rad] = max(Ai[2*rad], Ai[2*rad+1]);
    }
    return;
}

int Query(int rad, int st, int dr, int a, int b)
{
    if (a <= st && b >= dr)
        return Ai[rad];
    int m = (st+dr)/2, r1 = 0, r2 = 0;
    if (a <= m)
        r1 = Query(2*rad, st, m, a, b);
    if (b > m)
        r2 = Query(2*rad+1, m+1, dr, a, b);
    return max(r1, r2);
}

int main()
{
    int N, M, op, a, b;
    fin >> N >> M;
    for (int i = 1; i <= N; i++)
    {
        fin >> a;
        Update(1, 1, N, i, a);
    }
    while(M--)
    {
        fin >> op >> a >> b;
        if (op == 0)
            fout << Query(1, 1, N, a, b) << nl;
        else
            Update(1, 1, N, a, b);
    }
    return 0;
}