Pagini recente » Borderou de evaluare (job #2627891) | Diferente pentru problema/order2 intre reviziile 9 si 23 | Borderou de evaluare (job #2462118) | Cod sursa (job #793637) | Cod sursa (job #2380422)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,r;
f>>n;
f>>m;
int v[n];
for(int i=0;i<n;i++){
f>>v[i];
}
int ax,ay;
for(int i=0;i<m;i++){
f>>ax;
f>>ay;
r=v[ax-1];
for(int j=ax;j<ay;j++){
if(r>v[j]){
r=v[j];
}
}
g<<r<<endl;
}
g.close();
return 0;
}