Cod sursa(job #2523539)
Utilizator | Data | 14 ianuarie 2020 12:35:56 | |
---|---|---|---|
Problema | Range minimum query | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m,v[100001],x,y,min1;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n;
f>>m;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=m;i++){
f>>x>>y;
min1=100001;
for(int j=1;j<=n;j++){
if(v[j]>=x && v[j]<=y && v[j]<=min1)
min1=v[j];
}
if(min1!=100001)
g<<min1<<" ";
else
g<<"0";
}
return 0;
}