Cod sursa(job #3248866)
Utilizator | Data | 13 octombrie 2024 15:30:23 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
//ifstream cin ("rmq.in");
//ofstream cout("rmq.out");
int main()
{
int n, q;
cin >> n >> q;
int a[n+3];
for(int i=1; i<=n; i++)
cin >> a[i];
for(int i=1; i<=q; i++)
{
int x, y;
cin >> x >> y;
int val_min=100000;
for(int j=x; j<=y; j++)
if(a[j]<val_min)
val_min=a[j];
cout << val_min << endl;
}
return 0;
}