Cod sursa(job #1838596)
Utilizator | Data | 1 ianuarie 2017 14:14:08 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,a,b;
int rmq[100000];
int main(){
fin>>n>>m;
for (int i(1);i<=n;i++)fin>>rmq[i];
for (int j(1);j<=m;j++){fin>>a>>b;
long long it = 10000000;
for (int x=a;x<=b;x++) if (rmq[x]<it) it=rmq[x];
fout<<it<<endl;
}
return 0;
}