Cod sursa(job #1371355)
| Utilizator | Data | 3 martie 2015 20:53:29 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,min,m,i,j,b[10][2],a[10],k;
int main ()
{
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>a[i];
for (int k=1; k<=m;k++)
for(j=1;j<=2;j++)
fin>>b[k][j];
for(k=1;k<=m;k++)
{
int min=b[k][2];
for(i=1;i<=n;i++)
{
if (a[i]<min && a[i] >= b[k][1] )
min=a[i];
}
fout<<min;
fout<<endl;
}
return 0;
}