Cod sursa(job #883808)
Utilizator | Data | 20 februarie 2013 13:26:02 | |
---|---|---|---|
Problema | Range minimum query | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
int n,m,x,y,v[100010],i,min;
cin>>n>>m;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=m;i++)
{
cin>>x>>y;
min=v[x];
for(int j=x+1;j<=y;j++)
if(v[j]<min)
min=v[j];
cout<<min<<endl;
}
return 0;
}