Cod sursa(job #3300740)

Utilizator rapidu36Victor Manz rapidu36 Data 18 iunie 2025 18:36:22
Problema Range minimum query Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.33 kb
#include <fstream>
#include <vector>
#include <cmath>

using namespace std;

const int INF = 1e5;

void constructie_r(vector <vector <int>> &r, int nl, int nc)
{
    for (int i = 1; i <= nl; i++)
    {
        for (int j = 1; j <= nc; j++)
        {
            int p = (1 << (i - 1));
            r[i][j] = min(r[i-1][j-p], r[i-1][j]);
        }
    }
}

void constructie_log_2(vector <int> &log_2, int n)
{
    log_2[1] = 0;
    for (int i = 2; i <= n; i++)
    {
        log_2[i] = 1 + log_2[i/2];
    }
}

int raspuns(vector <vector <int>> &r, vector <int> &log_2, int st, int dr)
{
    int e = log_2[dr-st+1];
    int p = (1 << e);
    return min(r[e][st+p-1], r[e][dr]);
}

int main()
{
    ifstream in("rmq.in");
    ofstream out("rmq.out");
    int n, q;
    in >> n >> q;
    int log_2_n = (int)log2(n);
    vector <vector <int>> r(log_2_n + 1);
    for (int i = 0; i <= log_2_n; i++)
    {
        r[i].resize(n + 1, INF);
    }
    for (int j = 1; j <= n; j++)
    {
        in >> r[0][j];
    }
    constructie_r(r, log_2_n, n);
    vector <int> log_2(n + 1);
    constructie_log_2(log_2, n);
    for (int i = 0; i < q; i++)
    {
        int st, dr;
        in >> st >> dr;
        out << raspuns(r, log_2, st, dr) << "\n";
    }
    in.close();
    out.close();
    return 0;
}