Pagini recente » Istoria paginii runda/concursklumea2 | Cod sursa (job #1258458) | Istoria paginii runda/oni2012_ziua2_plus_baraj | Cod sursa (job #1338909) | Cod sursa (job #1447028)
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int LIM=100001;
int n, v[LIM], mat[17][LIM], log2[LIM];
int main()
{
int q;
fin>>n>>q;
for(int i=1; i<=n; ++i)
{
fin>>v[i];
mat[0][i]=i;
}
for(int i=2; i<=n; ++i)
log2[i]=1+log2[i/2];
for(int i=1; i<=log2[n]; ++i)
for(int j=1; j<=n-(1<<i)+1; ++j)
if(v[ mat[i-1][j] ]<v[ mat[i-1][j+(1<<(i-1))] ])
mat[i][j]=mat[i-1][j];
else
mat[i][j]=mat[i-1][j+(1<<(i-1))];
while(q--)
{
int x, y;
fin>>x>>y;
int lin=log2[y-x+1];
if(v[ mat[lin][x] ]<v[ mat[lin][y-(1<<lin)+1] ])
fout<<v[ mat[lin][x] ]<<'\n';
else
fout<<v[ mat[lin][y-(1<<lin)+1] ]<<'\n';
}
return 0;
}