Pagini recente » Cod sursa (job #2986738) | Cod sursa (job #2443917) | Cod sursa (job #2688930) | Cod sursa (job #2594837) | Cod sursa (job #2502764)
#include <bits/stdc++.h>
#define NMAX 100001
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,i,j,m,x,y,nr;
int ve[25][NMAX],v[NMAX];
void rmq(int ve[25][NMAX], int n)
{
int i,j;
for (i=1; (1<<i)<=n; i++)
{
for (j=1; j<=n; j++)
{
ve[i][j]=ve[i-1][j];
if(ve[i-1][j+(1<<(i-1))]<ve[i-1][j] && (j+(1<<(i-1)))<=n)
ve[i][j]=ve[i-1][j+(1<<(i-1))];
}
}
}
int main()
{
fin>>n>>m;
for (i=1; i<=n; i++)
{
fin>>ve[0][i];
}
rmq(ve,n);
for (i=2; i<=n; i++)
v[i]=v[i/2]+1;
for (i=1; i<=m; i++)
{
fin>>x>>y;
nr=v[y-x+1];
fout<<min(ve[nr][x],ve[nr][y-(1<<nr)+1])<<'\n';
}
return 0;
}