Cod sursa(job #1042733)
Utilizator | Data | 27 noiembrie 2013 17:19:23 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
long n,m,i,j,x,y,a[100000];
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for(i=0;i<n;i++)
f>>a[i];
for(i=0;i<m;i++)
{
f>>x>>y;
long minim=100001;
for(j=x-1;j<y;j++){
if(a[j]<minim)
minim=a[j];
}
g<<minim<<'\n';
}
return 0;
}