Pagini recente » Cod sursa (job #1849871) | Cod sursa (job #115686) | Cod sursa (job #2184298) | Cod sursa (job #2835735) | Cod sursa (job #3175895)
#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];
int x,y;
for(int i=0; i<=m; ++i)
{
in>>x>>y;
int mini=MAX;
for(int j=x; j<=y; ++j)
{
if(v[j]<mini)
mini=v[j];
}
out<<mini<<'\n';
}
return 0;
}