Pagini recente » Cod sursa (job #2219753) | Cod sursa (job #1121323) | Cod sursa (job #3030574) | Cod sursa (job #2128928) | Cod sursa (job #2900961)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fcin("rmq.in");
ofstream fcout("rmq.out");
int tl[100000]; //partea intreaga din logaritm in baza 2 (log[x] = [log2(x)])
int a[100000], n, aux;
int mat[16][100000]; //mat[i][j] = min(a[j], a[j+1], a[j+2], ..., a[j+2^i-1])
int main()
{
tl[1] = 0;
int n, m;
fcin>>n>>m;
for(int i=1; i<=n; i++)
fcin>>a[i];
for(int i=2; i<=n; i++)
tl[i] = tl[i/2]+1;
for(int j=1; j<=n; j++)
mat[0][j] = a[j];
for(int i=1; (1<<i)<=n; i++)
for(int j=1; j <= n-(1<<i)+1; j++)
mat[i][j] = min( mat[i-1][j], mat[i-1][j+(1<<(i-1))]);
int x, y;
while(m--)
{
fcin>>x>>y;
aux = tl[y-x+1];
cout<<min(mat[aux][x], mat[aux][y-(1<<aux)+1])<<'\n';
}
return 0;
}