Cod sursa(job #2754035)

Utilizator AlexandraBoghiuAlexandra Boghiu AlexandraBoghiu Data 24 mai 2021 21:36:42
Problema Arbori de intervale Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.33 kb
#include <fstream>
using namespace std;
ifstream F ("arbint.in");
ofstream G ("arbint.out");
int m, nr, n, a, b, v[400001], x, Max;
int maxim(int pozcurenta, int st, int dr, int a, int b)
{
    if(st > b || dr < a)
        return 0;
    if (a <= st && dr <= b)
        return v[pozcurenta];
    int mij = (st + dr) / 2;
    int Max1 = -1, Max2 = -1;

    //if (a <= mij)
        Max1 = maxim(2 * pozcurenta, st, mij, a, b);
   // else if (mij < dr)
        Max2 = maxim(2 * pozcurenta + 1, mij + 1, dr, a, b);

    return max(Max1, Max2);

}

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

}

int main()
{

    F>>n>>m;
    for(int i = 1; i <= n; i++)
    {
        F>>x;
        constr(1, 1, n, i, x);
    }
    for(int i = 0; i < m; i++)
    {
        F>>nr>>a>>b;
        if(nr == 0)
        {
           // Max = -1;
            Max = maxim(1, 1, n, a, b);
            G<<Max<<endl;
        }
        else
            constr(1, 1, n, a, b);

    }
    return 0;
}