Cod sursa(job #1015718)
Utilizator | Data | 25 octombrie 2013 00:30:01 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 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=1000001;
for (j=x; j<=y; j++)
if (a[j]<k)
k=a[j];
g<<k<<"\n";
}
return 0;
}