Pagini recente » Cod sursa (job #2335064) | Cod sursa (job #2574504) | Cod sursa (job #2467749) | Cod sursa (job #2035084) | Cod sursa (job #1799240)
//#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
//ifstream cin("rmq.in");
//ofstream cout("rmq.out");
vector <vector <int> > f;
vector <int> aux,a;
void solve()
{
for (int i=0; i<f.size(); i++)
{
f[i][i]=i;
}
for (int i=0; i<f.size(); i++)
{
for (int j=i+1; j<f.size(); j++)
{
if (a[f[i][j-1]]<a[j])
f[i][j]=f[i][j-1]; else f[i][j]=j;
}
}
}
main()
{
int n,m,x,y;
cin >> n >> m;
a.resize(n);
aux.resize(n);
for (int i=0; i<a.size(); i++)
{
f.push_back(aux);
cin >> a[i];
}
solve();
for ( ; m ; m--)
{
cin >> x >> y;
x--; y--;
cout << a[f[x][y]] << '\n';
}
}