Pagini recente » Cod sursa (job #2099879) | Cod sursa (job #1786968) | Cod sursa (job #943632) | Cod sursa (job #2252649) | Cod sursa (job #2864731)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int mat[43][100010];
#define nmax 100010
int v[100010],a,l,b;
int n,interogari;
int main(){
f>>n>>interogari;
for(int i=2; i<=nmax; i++)
v[i] = v[i/2] + 1;
for(int i=1;i<=n;i++)
{
f>>mat[0][i];
}
for(int i=1; i<=v[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))]);
}
while(interogari--)
{
f>>a>>b;
l = b-a+1;
g<<min(mat[v[l]][a], mat[v[l]][b-(1<<v[l])+1])<<'\n';
}
return 0;
}