Cod sursa(job #3175895)
| Utilizator | Data | 26 noiembrie 2023 15:23:17 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int MAX = 100000;
int v[MAX+1];
int main()
{
int n,m;
in>>n>>m;
for(int i=1; i<=n; ++i)
in>>v[i];
int x,y;
for(int i=0; i<=m; ++i)
{
in>>x>>y;
int mini=MAX;
for(int j=x; j<=y; ++j)
{
if(v[j]<mini)
mini=v[j];
}
out<<mini<<'\n';
}
return 0;
}
