Cod sursa(job #2238402)
| Utilizator | Data | 5 septembrie 2018 15:02:46 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,m,v[100001],i,j,aux,x,y;
int min(int,int);
int min(int x, int y)
{int i, mini=100001;
for(i=x; i<=y; i++)
if(v[i]<mini) mini=v[i];
return mini;
}
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1; i<=m; i++)
{f>>x>>y;
g<<min(x,y)<<'\n';}
return 0;
}
