Pagini recente » Cod sursa (job #3281983) | Cod sursa (job #1347508) | Cod sursa (job #1312178) | Cod sursa (job #2651580) | Cod sursa (job #3271869)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int MAX = 100000;
int v[MAX+1];
int main()
{
int n, m;
in>>n>>m;
for(int i=1; i<=n; ++i)
in>>v[i];
for(int i=0; i<m; ++i)
{
int st, dr;
in>>st>>dr;
int mini=MAX;
for(int j=st; j<=dr; ++j)
{
if(v[j]<mini)
mini=v[j];
}
out<<mini<<'\n';
}
return 0;
}