Cod sursa(job #2900568)

Utilizator iioaaana777Ghergu Ioana iioaaana777 Data 11 mai 2022 11:14:17
Problema Arbori de intervale Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.22 kb
#include <fstream>
#include <math.h>
#define NMAX 1000001
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int aint[NMAX];

void update(int N, int left, int right, int poz, int val)
{
    if(left == right)
    {
        aint[N] = val;
        return;
    }

    int mid = (left + right) / 2;

    if(poz <= mid)
        update(2*N, left, mid, poz, val);
    else
        update(2*N + 1, mid + 1, right, poz, val);

    aint[N] = max(aint[2*N], aint[2*N + 1]);
}

int query(int N, int left, int right, int a, int b)
{
    int v1 = 0, v2 = 0;

    if(a <= left && right <= b)
        return aint[N];

    int mid = (left + right) / 2;
    if(a <= mid)
         v1 = query(2*N, left, mid, a , b);


    if(b > mid)
         v2 = query(2*N + 1, mid + 1, right, a, b);

    return max(v1, v2);
}
int main()
{
    int N, M, x, left, right, op;

	fin>>N>>M;

	for(int i = 0; i < N; ++i)
    {
        fin>>x;
        update(1, 1, N, i + 1, x);
    }

	for(int i = 0; i < M; ++i)
    {
        fin>>op>>left>>right;
        if(op == 0)
            fout<<query(1, 1, N, left, right)<<"\n";
        else
            update(1, 1, N, left, right);
    }

    return 0;
}