Cod sursa(job #1052963)
Utilizator | Data | 11 decembrie 2013 22:49:54 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main()
{
int x,y,n,m,v[100000],i,min,j;
fin>>n>>m;
for(i=1; i<=n; i++)
fin>>v[i];
for(i=1; i<=m; i++)
{
fin>>x>>y;
min=v[x];
for(j=x+1; j<=y; j++)
if(min>v[j]) min=v[j];
fout<<min<<'\n';
}
}