Cod sursa(job #1425859)
Utilizator | Data | 28 aprilie 2015 10:59:41 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
long int a[100000];
long int n,i,j,k,m;
long int x,y;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=m;i++)
{
f>>x>>y;
k=1000000;
for (j=x;j<=y;j++)
if (a[j]<k) k=a[j];
g<<k<<'\n';
}
return 0;
}