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