Pagini recente » Clasament vote_for_duke | Cod sursa (job #945823) | Cod sursa (job #3180657) | Cod sursa (job #2621777) | Cod sursa (job #2790901)
#include <iostream>
#include <fstream>
using namespace std;
int minim(int v[],int st, int dr)
{
int mini=100001,i;
for(i=st;i<=dr;i++)
{
if(v[i]<mini)
mini=v[i];
}
return mini;
}
int main()
{
int n,m,v[100001],i,r[100001],x,y,k;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=m;i++)
{
fin>>x>>y;
r[++k]=minim(v,x,y);
}
for(i=2;i<=k;i++)
fout<<r[i]<<endl;
return 0;
}