Cod sursa(job #1052959)
| Utilizator | Data | 11 decembrie 2013 22:44:48 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include <iostream>
using namespace std;
int main()
{
int x,y,n,m,v[100000],i,min,j;
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(j=x+1; j<=y; j++)
if(min>v[j]) min=v[j];
cout<<min<<'\n';
}
}
