Pagini recente » Cod sursa (job #1951481) | Cod sursa (job #1002702) | Cod sursa (job #349266) | Borderou de evaluare (job #1900530) | Cod sursa (job #2626379)
#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rmq[10000][10000], v[10000];
int n,t,command,a,b,x;
void set_rmq(int v[], int n)
{
for(int i=1; i<=n; i++)
rmq[i][i] = i;
for(int i=1; i<=n; i++)
for(int j=i+1; j<=n; j++)
if(v[rmq[i][j-1]] < v[j])
rmq[i][j] = rmq[i][j-1];
else
rmq[i][j] = j;
}
void maxim(int x, int y)
{
g<<v[rmq[x][y]]<<endl;
}
int main()
{
f>>n>>t;
for(int i=1; i<=n; i++)
f>>v[i];
set_rmq(v,n);
for(int i=0; i<t; i++)
{
f>>a>>b;
maxim(a,b);
}
f.close();
g.close();
return 0;
}