Pagini recente » Cod sursa (job #2100162) | Cod sursa (job #1201537) | Cod sursa (job #1665754) | Cod sursa (job #813720) | Cod sursa (job #1725942)
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int n,a[100000],M[10000][10000],m;
void process1(int M[10000][10000], int A[10000], int N)
{
int i, j;
for (i =0; i < N; i++)
M[i][i] = i;
for (i = 0; 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()
{
int c,d;
fin>>n>>m;
int i,j;
for(i=1;i<=n;i++)
fin>>a[i];
process1(M,a,n+1);
for(i=1;i<=m;i++)
{fin>>c>>d;
fout<<a[M[c][d]]<<" ";}
return 0;
}