Pagini recente » Cod sursa (job #2769432) | Cod sursa (job #757169) | Cod sursa (job #2887853) | Cod sursa (job #2081277) | Cod sursa (job #2172490)
#include <iostream>
#include <cstdio>
#include <cmath>
#define N 100005
using namespace std;
int a[N], n, m[N][20], x, y, rez, mm;
void citire()
{
scanf("%d %d\n", &n, &mm);
for(int i=0;i<n;i++)
scanf("%d\n", &a[i]);
}
void matrice()
{
for(int i=0;i<n;i++)
m[i][0]=i;
for(int j=1;(1<<j)<n;j++)
for(int i=1;i+(1<<j)-1<n;i++)
if(a[m[i][j-1]]<=a[m[i+(1<<(j-1))][j-1]])
m[i][j]=m[i][j-1];
else
m[i][j]=m[i+(1<<(j-1))][j-1];
}
int main()
{
freopen("rmq.in", "r", stdin);
freopen("rmq.out", "w", stdout);
citire();
matrice();
for(int i=1;i<=mm;i++)
{
scanf("%d %d\n", &x, &y);
x--;
y--;
int k=log2(y-x+1);
if(a[m[x][k]]<=a[m[y-(1<<k)+1][k]])
rez=m[x][k];
else
rez=m[y-(1<<k)+1][k];
printf("%d\n", a[rez], x, y);
}
return 0;
}