Pagini recente » Cod sursa (job #2866179) | Cod sursa (job #2621447) | Cod sursa (job #788297) | Cod sursa (job #2431220) | Cod sursa (job #727939)
Cod sursa(job #727939)
#include<cstdio>
using namespace std;
int a[100005],m[2005][2005],n;
void process ()
{
int i,j;
for (i=1; i<=n; i++)
m[i][i]=i;
for (i=1; i<=n; i++)
for (j=i+1; j<=n; j++)
if (a[m[i][j-1]] < a[j])
m[i][j]=m[i][j-1];
else m[i][j]=j;
}
int main ()
{
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
int mm,i,x,y;
scanf("%d%d",&n,&mm);
for (i=1; i<=n; i++)
scanf("%d",&a[i]);
process();
for (i=1; i<=mm; i++)
{
scanf("%d%d",&x,&y);
printf("%d\n",a[m[x][y]]);
}
return 0;
}