Cod sursa(job #2228997)
Utilizator | Data | 5 august 2018 17:00:31 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,j,a[100000],x,y,z;
int main()
{
fin >> n >> m;
for (i=1;i<=n;++i) fin >> a[i];
for (i=1;i<=m;++i){
fin >> x >> y;
z=a[y];
for(j=x;j<=y;++j) if(a[j] < z) z=a[j];
fout << z << endl;
};
return 0;
}