Cod sursa(job #539069)
| Utilizator | Data | 22 februarie 2011 13:00:30 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream.h>
ifstream fin("rmq.in");
ofstream fout("rmq.out");
long long a[100000],b[1000000][2];
int main()
{
int n,m,i,j,min;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=m;i++)
{
for(j=1;j<=2;j++)
fin>>b[i][j];
}
for(i=1;i<=m;i++)
{ min=32000;
for(j=1;j<=n;j++)
if(a[j]>=b[i][1] && a[j]<=b[i][2] && a[j]<=min)
min=a[j];
fout<<min<<'\n';
}
return 0;
}
