Pagini recente » Cod sursa (job #2737415) | Cod sursa (job #2842116) | Cod sursa (job #2209287) | Cod sursa (job #2123788) | Cod sursa (job #1740985)
#include <iostream>
#include <fstream>
using namespace std;
int a[17][100001],n,m,i,lg[100001],x,y,k,j;
int main()
{
ifstream f("rmq.in");
ofstream g("rmq.out");
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>a[0][i];
}
lg[1]=0;
for(i=2;i<=n;i++)
{
lg[i]=lg[i/2]+1;
}
for(i=1;i<=lg[n];i++)
{
for(j=1;j<=n;j++)
{
a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
}
}
for(i=1;i<=m;i++)
{
f>>x>>y;
k=lg[y-x+1];
g<<min(a[k][x],a[k][y-(1<<k)+1])<<"\n";
}
return 0;
}