Cod sursa(job #1148332)
Utilizator | Data | 20 martie 2014 18:03:35 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, m, i, j, min1, v[100001];
int main(){
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for(int i=1;i<=n;i++)
f>>v[i];
for(int k=1;k<=m;k++){
f>>i>>j;
cout<<i<<" "<<j;
min1=v[i];
for(;i<=j;i++)
min1=min(min1, v[i]);
g<<min1<<"\n";
}
return 0;
}