Cod sursa(job #2788201)
| Utilizator | Data | 25 octombrie 2021 11:42:15 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, v[100005];
int solve(int x, int y)
{
int mi = INT_MAX;
for(int i = x; i <= y; i ++)
{
if(v[i] < mi)
mi = v[i];
}
return mi;
}
void read()
{
fin >> n >> m;
for(int i = 1; i <= n ; i ++)
fin >> v[i];
int x, y;
for(int i = 1; i <= m; i ++)
{
fin >> x >> y;
fout << solve(x, y) << "\n";
}
}
int main()
{
read();
return 0;
}
