Pagini recente » Cod sursa (job #2301275) | Cod sursa (job #665354) | Cod sursa (job #425398) | Cod sursa (job #2781577) | Cod sursa (job #1725962)
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int i,j,n,m,a[10000],b[10000],aux,c,d,ok,k;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{fin>>a[i];
b[i]=a[i];
}
for(i=1;i<=m;i++)
{
fin>>c>>d;
do
{
ok=0;
for(j=c;j<d;j++)
if(b[j]>=b[j+1])
{
aux=b[j];
b[j]=b[j+1];
b[j+1]=aux;
ok=1;
}
}while(ok==1);
fout<<b[c]<<'\n';
for(k=1;k<=n;k++)
b[k]=a[k];
}
return 0;
}